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. © 2004 Elsevier B.V. All rights reserved.
Record created on 2008-05-13, modified on 2016-08-08