2021
DOI: 10.48550/arxiv.2103.03035
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Computing Subset Feedback Vertex Set via Leafage

Abstract: Chordal graphs are characterized as the intersection graphs of subtrees in a tree and such a representation is known as the tree model. Restricting the characterization results in well-known subclasses of chordal graphs such as interval graphs or split graphs. A typical example that behaves computationally different in subclasses of chordal graph is the Subset Feedback Vertex Set (SFVS) problem: given a graph G = (V, E) and a set S ⊆ V , SFVS asks for a minimum set of vertices that intersects all cycles contai… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 26 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?