An improved exact algorithm for undirected feedback vertex set

A feedback vertex set in an undirected graph is a subset of vertices removal of which leaves a graph with no cycles. Razgon (in: Proceedings of the 10th Scandinavian workshop on algorithm theory (SWAT 2006), pp. 160–171, 2006 ) gave a 1 . 8899 n n O ( 1 ) -time algorithm for finding a minimum feedba...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization Jg. 30; H. 2; S. 214 - 241
Hauptverfasser:	Xiao, Mingyu, Nagamochi, Hiroshi
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.08.2015
Schlagworte:	Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Measure and conquer Exact exponential algorithms Feedback vertex set Branch and bound
ISSN:	1382-6905, 1573-2886
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!