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.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Theoretical computer science Jg. 326; H. 1; S. 57 - 67
Hauptverfasser:	Eisenbrand, Friedrich, Grandoni, Fabrizio
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 20.10.2004 Elsevier
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!