The complexity of the vertex-minor problem
From MaRDI portal
Publication:6320458
DOI10.1016/J.IPL.2021.106222zbMath1533.68104arXiv1906.05689MaRDI QIDQ6320458
Stephanie Wehner, Jonas Helsen, Axel Dahlberg
Publication date: 12 June 2019
Analysis of algorithms and problem complexity (68Q25) Graph minors (05C83) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62)
This page was built for publication: The complexity of the vertex-minor problem