On the complexity of fixed parameter clique and dominating set

Authors:
Friedrich Eisenbrand;Fabrizio Grandoni
Affiliations:
Max-Planck-Institut fü/r Informatik, Stuhlsatzenhausweg 85, Saarbrü/cken, Germany;Dipartimento di Informatica, Sistemi e Produzione, Universitagrave/ di Roma "Tor Vergata", Via del Politecnico I, 00133 Roma, Italy
Venue:
Theoretical Computer Science
Year:
2004

Citing 9
Cited 16

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Fixed-parameter tractability and completeness II: on completeness for W[1]

Theoretical Computer Science
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Rectangular matrix multiplication revisited

Journal of Complexity
On Syntactic versus Computational Views of Approximability

SIAM Journal on Computing
Fast rectangular matrix multiplication and applications

Journal of Complexity
Finding and counting small induced subgraphs efficiently

Information Processing Letters
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Extremal Graph Theory

Extremal Graph Theory

Finding and counting cliques and independent sets in r-uniform hypergraphs

Information Processing Letters
Open problems around exact algorithms

Discrete Applied Mathematics
Efficient algorithms for clique problems

Information Processing Letters
Elimination Graphs

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics

WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Finding heaviest H-subgraphs in real weighted graphs, with applications

ACM Transactions on Algorithms (TALG)
On the possibility of faster SAT algorithms

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Unique small subgraphs are not easier to find

LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Counting and detecting small subgraphs via equations and matrix multiplication

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Finding the smallest H-Subgraph in real weighted graphs and related problems

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Elimination graphs

ACM Transactions on Algorithms (TALG)
Decremental clique problem

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Arboricity, h-index, and dynamic algorithms

Theoretical Computer Science
Towards fully multivariate algorithmics: Parameter ecology and the deconstruction of computational complexity

European Journal of Combinatorics
Exact weight subgraphs and the k-sum conjecture

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
A dynamic data structure for counting subgraphs in sparse graphs

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	5.23

Visualization

Abstract

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.