Edge-Editing to a Dense and a Sparse Graph Class
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00094278" target="_blank" >RIV/00216224:14330/16:00094278 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-662-49529-2_42" target="_blank" >http://dx.doi.org/10.1007/978-3-662-49529-2_42</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-662-49529-2_42" target="_blank" >10.1007/978-3-662-49529-2_42</a>
Alternative languages
Result language
angličtina
Original language name
Edge-Editing to a Dense and a Sparse Graph Class
Original language description
We consider a graph edge-editing problem, where the goal is to transform a given graph G into a disjoint union of two graphs from a pair of given graph classes, investigating what properties of the classes make the problem fixed-parameter tractable. We focus on the case when the first class is dense, i.e. every such graph G has minimum degree at least |V (G)| - delta for a constant delta, and assume that the cost of editing to this class is fixed-parameter tractable parameterized by the cost. Under the assumptions that the second class either has bounded maximum degree, or is edge-monotone, can be defined in MSO2, and has bounded treewidth, we prove that the problem is fixed-parameter tractable parameterized by the cost. We also show that the problem is fixed-parameter tractable parameterized by degeneracy if the second class consists of independent sets and Subgraph Isomorphism is fixedparameter tractable for the input graphs.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
LATIN 2016: Latin American Symposium on Theoretical Informatics
ISBN
9783662495285
ISSN
0302-9743
e-ISSN
—
Number of pages
14
Pages from-to
562-575
Publisher name
Springer
Place of publication
Berlin
Event location
Ensenada; Mexico
Event date
Jan 1, 2016
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—