Block elimination distance

DOI10.1007/978-3-030-86838-3_3MaRDI QIDQ5925550zbMATH OpenOpenAlexFDO

Authors Öznur Yaşar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos

Publication date 8 June 2022

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2103.01872

zbMATH Keywords

biconnected graphselimination distancegraph minorsobstructionsparameterized algorithms

Mathematics Subject Classification ID

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

Cites work

• A\,V^ 2 algorithm for determining isomorphism of planar graphs
• An Efficient Algorithm for Graph Isomorphism
• Elimination Distance to Bounded Degree on Planar Graphs
• Fixed-parameter tractable distances to sparse graph classes
• Graph isomorphism parameterized by elimination distance to bounded degree
• Graph minors. XIII: The disjoint paths problem
• Graph minors. XX: Wagner's conjecture
• scientific article; zbMATH DE number 5764786 (Why is no real title available?)
• Isomorphism of planar graphs (working paper)
• On the Parameterized Complexity of Clique Elimination Distance
• Parameterized and Exact Computation
• The disjoint paths problem in quadratic time
• Vertex deletion parameterized by elimination distance and even less

Cited in

(1)

• Edit distance with block deletions

This page was built for publication: Block elimination distance

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