Recommendations
- Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract)
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Parameterized clique on inhomogeneous random graphs
- Finding hidden cliques in linear time with high probability
- ON TWO APPROXIMATION ALGORITHMS FOR THE CLIQUE PROBLEM
Cites work
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 1261820 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 3340123 (Why is no real title available?)
- Algorithms for maximum independent sets
- All-pairs shortest paths for unweighted undirected graphs in o(mn) time
- Color-coding
- Divide-and-Color
- Fast recognition of pushdown automaton and context-free languages
- Finding a Minimum Circuit in a Graph
- Finding and counting given length cycles
- Finding and counting small induced subgraphs efficiently
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Gaussian elimination is not optimal
- Improved algorithms for path, matching, and packing problems
- Linear FPT reductions and computational lower bounds
- Matrix multiplication via arithmetic progressions
- Measure and conquer
- On the complexity of fixed parameter clique and dominating set
- Parameterized and Exact Computation
Cited in
(18)- A linear time algorithm for maximal clique enumeration in large sparse graphs
- Faster algorithms for all-pairs bounded min-cuts
- Large clique is hard on average for resolution
- A post-quantum associative memory
- On the average-case complexity of parameterized clique
- An Efficient Algorithm for Enumerating Pseudo Cliques
- Counting Homomorphic Cycles in Degenerate Graphs
- If the current clique algorithms are optimal, so is Valiant's parser
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
- Graph pattern detection: hardness for all induced patterns and faster noninduced cycles
- Computing the depth distribution of a set of boxes
- Pushdown reachability with constant treewidth
- On linear algebraic algorithms for the subgraph matching problem and its variants
- Tight conditional lower bounds for vertex connectivity problems
- On approximating the number of \(k\)-cliques in sublinear time
- Counting Subgraphs in Degenerate Graphs
- Hardness of RNA folding problem with four symbols
- Faster combinatorial \(k\)-clique algorithms
This page was built for publication: Efficient algorithms for clique problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976087)
