Faster combinatorial \(k\)-clique algorithms

DOI10.1007/978-3-031-55598-5_13MaRDI QIDQ6547932

Yarin Shechter, Amir Abboud, Nick Fischer

Publication date: 31 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of fixed parameter clique and dominating set
• Szemerédi's lemma for the analyst
• Efficient algorithms for clique problems
• An improved combinatorial algorithm for Boolean matrix multiplication
• Subquadratic algorithms for 3SUM
• Gaussian elimination is not optimal
• Towards polynomial lower bounds for dynamic problems
• Fast context-free grammar parsing requires fast boolean matrix multiplication
• A (slightly) faster algorithm for klee's measure problem
• If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser
• Higher Lower Bounds from the 3SUM Conjecture
• Subcubic Equivalences Between Path, Matrix, and Triangle Problems
• ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
• Listing Triangles
• Graph pattern detection: hardness for all induced patterns and faster non-induced cycles
• Speeding up the Four Russians Algorithm by About One More Logarithmic Factor
• Hardness of RNA Folding Problem With Four Symbols.
• Algorithms – ESA 2004
• Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)
• Range closest-pair search in higher dimensions
• Tight dynamic problem lower bounds from generalized BMM and OMv

This page was built for publication: Faster combinatorial \(k\)-clique algorithms