scientific article; zbMATH DE number 6862097

DOI10.4230/LIPICS.STACS.2017.5MaRDI QIDQ4636602zbMATH OpenFDO

Authors Akanksha Agrawal, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi

Publication date 19 April 2018

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2017.5

zbMATH Keywords

edge contractionparameterized complexitysplit graph

Mathematics Subject Classification ID

Graph minors (05C83) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Split contraction: the untold story
• Split continuity: a different perspective
• Split continuity
• scientific article; zbMATH DE number 3913057
• Splittings
• The dynamics of contractions
• A survey of multiple contractions
• Contraction contracted
• scientific article; zbMATH DE number 3853816

Cited in

(10)

• On the parameterized complexity of contraction to generalization of trees
• Fine-grained complexity of rainbow coloring and its variants
• On the parameterized approximability of contraction to classes of chordal graphs
• Fine-Grained Complexity of Rainbow Coloring and its Variants.
• On the parameterized complexity of contraction to generalization of trees
• Split contraction: the untold story
• Obtaining split graphs by edge contraction
• On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
• Computation of Hadwiger number and related contraction problems: tight lower bounds
• Obtaining split graphs by edge contraction

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636602)