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.

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 326; no. 1; pp. 57 - 67
Main Authors:	Eisenbrand, Friedrich, Grandoni, Fabrizio
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 20.10.2004 Elsevier
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!