Linear-time Kernelization for Feedback Vertex Set

In this paper, we propose an algorithm that, given an undirected graph $G$ of $m$ edges and an integer $k$, computes a graph $G'$ and an integer $k'$ in $O(k^4 m)$ time such that (1) the size of the graph $G'$ is $O(k^2)$, (2) $k'\leq k$, and (3) $G$ has a feedback vertex set of...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Iwata, Yoichi
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!