License
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.SOSA.2018.1
URN: urn:nbn:de:0030-drops-82961
URL: http://drops.dagstuhl.de/opus/volltexte/2018/8296/
Go to the corresponding OASIcs Volume Portal


Cao, Yixin

A Naive Algorithm for Feedback Vertex Set

pdf-format:
OASIcs-SOSA-2018-1.pdf (0.5 MB)


Abstract

Given a graph on n vertices and an integer k, the feedback vertex set problem asks for the deletion of at most k vertices to make the graph acyclic. We show that a greedy branching algorithm, which always branches on an undecided vertex with the largest degree, runs in single-exponential time, i.e., O(c^k n^2) for some constant c.

BibTeX - Entry

@InProceedings{cao:OASIcs:2018:8296,
  author =	{Yixin Cao},
  title =	{{A Naive Algorithm for Feedback Vertex Set }},
  booktitle =	{1st Symposium on Simplicity in Algorithms (SOSA 2018)},
  pages =	{1:1--1:9},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-064-4},
  ISSN =	{2190-6807},
  year =	{2018},
  volume =	{61},
  editor =	{Raimund Seidel},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/8296},
  URN =		{urn:nbn:de:0030-drops-82961},
  doi =		{10.4230/OASIcs.SOSA.2018.1},
  annote =	{Keywords: greedy algorithm, analysis of algorithms, branching algorithm, parameterized computation -- graph modification problem}
}

Keywords: greedy algorithm, analysis of algorithms, branching algorithm, parameterized computation -- graph modification problem
Seminar: 1st Symposium on Simplicity in Algorithms (SOSA 2018)
Issue Date: 2018
Date of publication: 05.01.2018


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI