Skip to main content
Conference Proceedings

Feedback vertex set in mixed graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6844 LNCS 122-133
DOI: 10.1007/978-3-642-22300-6_11
12Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A mixed graph is a graph with both directed and undirected edges. We present an algorithm for deciding whether a given mixed graph on n vertices contains a feedback vertex set (FVS) of size at most k, in time O(47.5 k·k!·n4). This is the first fixed parameter tractable algorithm for FVS that applies to both directed and undirected graphs. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Bonsma, P., & Lokshtanov, D. (2011). Feedback vertex set in mixed graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 122–133). https://doi.org/10.1007/978-3-642-22300-6_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free