Finding small complete subgraphs efficiently
From MaRDI portal
Cites work
- k-Degenerate Graphs
- Approximately counting triangles in sublinear time
- Arboricity and bipartite subgraph listing algorithms
- Arboricity and Subgraph Listing Algorithms
- Counting cycles and finite dimensional \(L^{p}\) norms
- Decomposition of Finite Graphs Into Forests
- Dynamic set intersection
- Edge-Coloring and f-Coloring for Various Classes of Graphs
- Edge-Disjoint Spanning Trees of Finite Graphs
- Efficient algorithms for subgraph listing
- Efficient triangle counting in large graphs via degree-based vertex partitioning
- Finding a Minimum Circuit in a Graph
- Finding and counting given length cycles
- Finding and counting small induced subgraphs efficiently
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
- Introduction to algorithms.
- Listing triangles
- Matrix multiplication via arithmetic progressions
- On the complexity of fixed parameter clique and dominating set
- On the Problem of Decomposing a Graph into n Connected Factors
- Triangle listing algorithms: back from the diversion
Cited in
(3)
This page was built for publication: Finding small complete subgraphs efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182903)
