Minimum weight feedback vertex sets in circle graphs
From MaRDI portal
Publication:963384
DOI10.1016/J.IPL.2007.12.003zbMATH Open1185.05077OpenAlexW2038177235MaRDI QIDQ963384FDOQ963384
Authors: Fanica Gavril 
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.12.003
Recommendations
- Minimum weight feedback vertex sets in circle \(n\)-gon graphs and circle trapezoid graphs
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- An algorithm to find a minimum feedback vertex set of an interval graph
- Feedback vertex set on AT-free graphs
- A linear time algorithm for the minimum-weight feedback vertex set problem in series-parallel graphs
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Signed and weighted graphs (05C22)
Cites Work
- The Complexity of Coloring Circular Arcs and Chords
- Title not available (Why is that?)
- The maximum k-colorable subgraph problem for chordal graphs
- Permutation Graphs and Transitive Graphs
- Graph-Theoretic Concepts in Computer Science
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Recognition of Circle Graphs
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs
- An algorithm to find a minimum feedback vertex set of an interval graph
- 3D-interval-filament graphs
- Feedback vertex set on cocomparability graphs
Cited In (12)
- An algorithm to find a minimum feedback vertex set of an interval graph
- Parameterized domination in circle graphs
- Minimum weight feedback vertex sets in circle \(n\)-gon graphs and circle trapezoid graphs
- Circular convex bipartite graphs: feedback vertex set
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- Circular convex bipartite graphs: feedback vertex sets
- Feedback vertex sets on restricted bipartite graphs
- Feedback vertex set on AT-free graphs
- MIP formulations for induced graph optimization problems: a tutorial
- Large Induced Subgraphs via Triangulations and CMSO
- Two Hardness Results on Feedback Vertex Sets
This page was built for publication: Minimum weight feedback vertex sets in circle graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963384)
