Minimum weight feedback vertex sets in circle graphs
type: Item
instance of: scholarly article
title: Minimum weight feedback vertex sets in circle graphs
zbMATH Open document ID: 1185.05077
author: Fanica Gavril
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5694944
zbMATH Keywords: minimum feedback vertex set
zbMATH Keywords: maximum induced forest
zbMATH Keywords: circle graph
zbMATH Keywords: graph algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2007.12.003
OpenAlex ID: W2038177235
cites work: Feedback vertex set on cocomparability graphs
cites work: Q5684962
cites work: Permutation Graphs and Transitive Graphs
cites work: The Complexity of Coloring Circular Arcs and Chords
cites work: Algorithms for a maximum clique and a maximum independent set of a circle graph
cites work: Maximum weight independent sets and cliques in intersection graphs of filaments
cites work: 3D-interval-filament graphs
cites work: Approximating the minimum clique cover and other hard problems in subtree filament graphs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q4526776
cites work: Q4138414
cites work: Q3539484
cites work: Recognition of Circle Graphs
cites work: The maximum k-colorable subgraph problem for chordal graphs
DOI: 10.1016/J.IPL.2007.12.003
description: scientific article; zbMATH DE number 5694944