On the complexity of fixed parameter clique and dominating set

We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection.

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 326; číslo 1; s. 57 - 67
Hlavní autoři:	Eisenbrand, Friedrich, Grandoni, Fabrizio
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 20.10.2004 Elsevier
Témata:	Algorithmics. Computability. Computer arithmetics Applied sciences Clique Combinatorics. Ordered structures Computer science; control theory; systems Diamonds detection Dominating set Exact sciences and technology Mathematics Order, lattices, ordered algebraic structures Parameterized algorithms Sciences and techniques of general use Theoretical computing Clique Parameterized algorithms Dominating set Diamonds detection Multiplication Computer theory Ordered set Parameterized algorithm Diamond detection Rectangular matrix Complexity
ISSN:	0304-3975, 1879-2294
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!