Modifying a graph using vertex elimination

DOI10.1007/s00453-013-9848-2zbMath1314.68232MaRDI QIDQ2345941

Daniël Paulusma, Fredrik Manne, Petr A. Golovach, Michał Pilipczuk, Pinar Heggernes, Pim van 't Hof

Publication date: 21 May 2015

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/14116/1/14116.pdf

zbMATH Keywords

parameterized complexity; graph modification problems; vertex elimination; linear kernel

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C76: Graph operations (line graphs, products, etc.)

Uses Software

• symrcm