Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree

DOI10.1007/978-3-319-13524-3_12zbMath1341.68058DBLPconf/iwpec/BulianD14arXiv1406.4718OpenAlexW2570782777WikidataQ58215464 ScholiaQ58215464MaRDI QIDQ2946014

Anuj Dawar, Jannis Bulian

Publication date: 15 September 2015

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Fixed-parameter tractable distances to sparse graph classes

This page was built for publication: Graph Isomorphism Parameterized by Elimination Distance to Bounded Degree