Graph-Theoretic Concepts in Computer Science
From MaRDI portal
Graph-Theoretic Concepts in Computer Science (scientific article; zbMATH DE number 5655944)
Recommendations
- Feedback vertex set on AT-free graphs
- Connected feedback vertex set on AT-free graphs
- Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth
- Feedback vertex sets and cyclically reducible graphs
- On the feedback vertex set problem for a planar graph
- Independent feedback vertex sets for graphs of bounded diameter
- Solving the feedback vertex set problem on undirected graphs
- Feedback vertex sets on restricted bipartite graphs
- On parameterized independent feedback vertex set
- On parameterized independent feedback vertex set
Cited in
(12)- An improved algorithm for the longest induced path problem on \(k\)-chordal graphs
- Mim-width. I. Induced path problems
- New upper bounds on feedback vertex numbers in butterflies
- New formulations and branch-and-cut procedures for the longest induced path problem
- Lower and upper bounds for long induced paths in 3-connected planar graphs
- Polynomial-time algorithms for the longest induced path and induced disjoint paths problems on graphs of bounded mim-width
- MIP formulations for induced graph optimization problems: a tutorial
- Contracting to a longest path in H-free graphs
- Connected feedback vertex set on AT-free graphs
- Connected feedback vertex set on AT-free graphs
- Feedback vertex set on AT-free graphs
- Minimum weight feedback vertex sets in circle graphs
This page was built for publication: Graph-Theoretic Concepts in Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902531)
