Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover

Our goal in this paper is the development of fast algorithms for recognizing general classes of graphs. We seek algorithms whose complexity can be expressed as a linear function of the graph size plus an exponential function of k, a natural parameter describing the class. In particular, we consider...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Discrete Applied Mathematics Ročník 152; číslo 1; s. 229 - 245
Hlavní autoři:	Nishimura, Naomi, Ragde, Prabhakar, Thilikos, Dimitrios M.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Lausanne Elsevier B.V 01.11.2005 Amsterdam Elsevier New York, NY
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Exact sciences and technology FPT algorithms Graph minors Graph theory Mathematics Parameterized complexity Sciences and techniques of general use Theoretical computing Parameterized complexity Graph minors FPT algorithms Computer theory Linear function FTP algorithm Parametrized complexity Connected graph Vertex(graph) Exponential function Upper bound Minimal graph Algorithm complexity Graph degree Fast algorithm Combinatorics Linear graph
ISSN:	0166-218X, 1872-6771
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!