The complexity of the vertex-minor problem
From MaRDI portal
Publication:2059901
DOI10.1016/J.IPL.2021.106222OpenAlexW3216353401MaRDI QIDQ2059901FDOQ2059901
Authors: Axel Dahlberg, Jonas Helsen, S. Wehner 
Publication date: 14 December 2021
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.05689
Recommendations
- The algorithmic complexity of minus domination in graphs
- The MIN-cut and vertex separator problem
- The complexity of induced minors and related problems
- The complexity of some graph problems with bounded minors of their constraint matrices
- The Complexity of Vertex Enumeration Methods
- scientific article; zbMATH DE number 795221
- The algorithmic complexity of the minus clique-transversal problem
- On the hardness of approximating minimum vertex cover
- The complexity of the minimum \(k\)-cover problem
- The complexity of minimum-length path decompositions
Cites Work
- Transforming graph states using single-qubit operations
- Reducibility among combinatorial problems
- Algorithmic graph theory and perfect graphs
- Approximating clique-width and branch-width
- Über eine Eigenschaft der ebenen Komplexe
- Circle graph obstructions
- Graphs of small rank-width are pivot-minors of graphs of small tree-width
- Rank-width and vertex-minors
- Graph minors. I. Excluding a forest
- S-functions for graphs
- Title not available (Why is that?)
- Circle graphs and monadic second-order logic
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Title not available (Why is that?)
- Circle graph obstructions under pivoting
- Excluded vertex-minors for graphs of linear rank-width at most \(k\)
- Rank-width: algorithmic and structural results
- Computing small pivot-minors
Cited In (4)
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 Q2059901)
