The complexity of the vertex-minor problem
From MaRDI portal
Publication:6320458
DOI10.1016/J.IPL.2021.106222arXiv1906.05689MaRDI QIDQ6320458FDOQ6320458
Authors: Axel Dahlberg, Jonas Helsen, S. Wehner 
Publication date: 12 June 2019
Abstract: A graph H is a vertex-minor of a graph G if it can be reached from G by the successive application of local complementations and vertex deletions. Vertex-minors have been the subject of intense study in graph theory over the last decades and have found applications in other fields such as quantum information theory. Therefore it is natural to consider the computational complexity of deciding whether a given graph G has a vertex-minor isomorphic to another graph H, which was previously unknown. Here we prove that this decision problem is NP-complete, even when restricting H, G to be circle graphs, a class of graphs that has a natural relation to vertex-minors.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph representations (geometric and intersection representations, etc.) (05C62) Graph minors (05C83)
This page was built for publication: The complexity of the vertex-minor problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6320458)
