Block elimination distance

DOI10.1007/s00373-022-02513-yzbMath1494.05104OpenAlexW3134773034MaRDI QIDQ5918777

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

Publication date: 8 August 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02513-y

zbMATH Keywords

parameterized algorithmsgraph minorsminor obstructionsblock elimination distanceelimination distance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

\(k\)-apices of minor-closed graph classes. I: Bounding the obstructions

Cites Work

• Unnamed Item
• Graph isomorphism parameterized by elimination distance to bounded degree
• The disjoint paths problem in quadratic time
• Graph minors. XIII: The disjoint paths problem
• Fixed-parameter tractable distances to sparse graph classes
• \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs
• A shorter proof of the graph minor algorithm
• In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
• Isomorphism of Planar Graphs (Working Paper)
• A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs
• Elimination Distance to Bounded Degree on Planar Graphs
• Parameterized and Exact Computation
• Improved Bounds for the Flat Wall Theorem
• An Efficient Algorithm for Graph Isomorphism
• k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
• Vertex deletion parameterized by elimination distance and even less
• On the Parameterized Complexity of Clique Elimination Distance

This page was built for publication: Block elimination distance