A Polynomial Kernel for Line Graph Deletion

06/28/2020
by   Eduard Eiben, et al.
0

The line graph of a graph G is the graph L(G) whose vertex set is the edge set of G and there is an edge between e,f∈ E(G) if e and f share an endpoint in G. A graph is called line graph if it is a line graph of some graph. We study the Line-Graph-Edge Deletion problem, which asks whether we can delete at most k edges from the input graph G such that the resulting graph is a line graph. More precisely, we give a polynomial kernel for Line-Graph-Edge Deletion with 𝒪(k^5) vertices. This answers an open question posed by Falk Hüffner at Workshop on Kernels (WorKer) in 2013.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2019

Kernel for Kt-free edge deletion

In the K_t-free edge deletion problem, the input is a graph G and an int...
research
03/26/2021

Beyond the adjacency matrix: random line graphs and inference for networks with edge attributes

Any modern network inference paradigm must incorporate multiple aspects ...
research
02/26/2019

A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening

How might one "reduce" a graph? That is, generate a smaller graph that p...
research
10/05/2017

Efficient Generation of Geographically Accurate Transit Maps

We present LOOM (Line-Ordering Optimized Maps), a fully automatic genera...
research
05/22/2014

Efficient Hybrid Inline and Out-of-line Deduplication for Backup Storage

Backup storage systems often remove redundancy across backups via inline...
research
07/04/2012

On Bayesian Network Approximation by Edge Deletion

We consider the problem of deleting edges from a Bayesian network for th...
research
06/08/2020

Near-Perfect Recovery in the One-Dimensional Latent Space Model

Suppose a graph G is stochastically created by uniformly sampling vertic...

Please sign up or login with your details

Forgot password? Click here to reset