An output sensitive algorithm for maximal clique enumeration in sparse graphs
From MaRDI portal
Publication:5111887
DOI10.4230/LIPICS.IPEC.2017.27zbMATH Open1448.05191MaRDI QIDQ5111887FDOQ5111887
Publication date: 27 May 2020
Recommendations
- Listing all maximal cliques in sparse graphs in near-optimal time
- A new decomposition technique for maximal clique enumeration for sparse graphs
- Listing all maximal cliques in large sparse real-world graphs
- Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30) Density (toughness, etc.) (05C42)
Cites Work
- Algorithm 457: finding all cliques of an undirected graph
- Algorithms on Strings, Trees and Sequences
- A New Algorithm for Generating All the Maximal Independent Sets
- k-Degenerate Graphs
- On cliques in graphs
- A note on the problem of reporting maximal cliques
- A Space-Economical Suffix Tree Construction Algorithm
- On generating all maximal independent sets
- On-line construction of suffix trees
- Arboricity and Subgraph Listing Algorithms
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Algorithm Theory - SWAT 2004
- Fast maximal cliques enumeration in sparse graphs
- Listing All Maximal Cliques in Large Sparse Real-World Graphs
- Title not available (Why is that?)
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
Cited In (3)
Uses Software
This page was built for publication: An output sensitive algorithm for maximal clique enumeration in sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111887)
