Minimum weight feedback vertex sets in circle graphs

Authors:
Fanica Gavril
Affiliations:
Computer Science Department, Technion, Haifa 32000, Israel
Venue:
Information Processing Letters
Year:
2008

Citing 6
Cited 5

The maximum k-colorable subgraph problem for chordal graphs

Information Processing Letters
Recognition of circle graphs

Journal of Algorithms
Permutation Graphs and Transitive Graphs

Journal of the ACM (JACM)
Maximum weight independent sets and cliques in intersection graphs of filaments

Information Processing Letters
Approximating the minimum clique cover and other hard problems in subtree filament graphs

Discrete Applied Mathematics
3D-interval-filament graphs

Discrete Applied Mathematics

Two hardness results on feedback vertex sets

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Tractable feedback vertex sets in restricted bipartite graphs

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Parameterized domination in circle graphs

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Feedback vertex sets on restricted bipartite graphs

Theoretical Computer Science
Parameterized Domination in Circle Graphs

Theory of Computing Systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

We describe a polynomial time algorithm to find a minimum weight feedback vertex set, or equivalently, a maximum weight induced forest, in a circle graph. The circle graphs are the overlap graphs of intervals on a line.