Subset feedback vertex sets in chordal graphs

Given a graph G=(V,E) and a set S⊆V, a set U⊆V is a subset feedback vertex set of (G,S) if no cycle in G[V∖U] contains a vertex of S. The Subset Feedback Vertex Set problem takes as input G, S, and an integer k, and the question is whether (G,S) has a subset feedback vertex set of cardinality or wei...

Full description

Bibliographic Details

Published in:	Journal of discrete algorithms (Amsterdam, Netherlands) Vol. 26; pp. 7 - 15
Main Authors:	Golovach, Petr A., Heggernes, Pinar, Kratsch, Dieter, Saei, Reza
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.05.2014
Subjects:	Chordal graph Exact exponential-time algorithm Maximum number of minimal subset feedback vertex sets Subset feedback vertex set Chordal graph Subset feedback vertex set Maximum number of minimal subset feedback vertex sets Exact exponential-time algorithm
ISSN:	1570-8667, 1570-8675
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!