Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
From MaRDI portal
Publication:1987232
Recommendations
- Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
- Fast maximal cliques enumeration in sparse graphs
- Algorithm Theory - SWAT 2004
- A linear time algorithm for maximal clique enumeration in large sparse graphs
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
Cites work
- A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
- A New Algorithm for Generating All the Maximal Independent Sets
- A note on the problem of reporting maximal cliques
- Algorithm 457: finding all cliques of an undirected graph
- Algorithm Theory - SWAT 2004
- An efficient algorithm for solving pseudo clique enumeration problem
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- Arboricity and Subgraph Listing Algorithms
- Color-coding
- Corrections to Bierstone's Algorithm for Generating Cliques
- Efficient enumeration of induced subtrees in a K-degenerate graph
- Enumeration Of Labelled Graphs
- Enumeration aspects of maximal cliques and bicliques
- Fast maximal cliques enumeration in sparse graphs
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties
- Listing Maximal Independent Sets with Minimal Space and Bounded Delay
- Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
- Listing all maximal cliques in large sparse real-world graphs
- Listing all maximal cliques in sparse graphs in near-optimal time
- Listing triangles
- On cliques in graphs
- On generating all maximal independent sets
- Reverse search for enumeration
- Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
- The Enumeration of Maximal Cliques of Large Graphs
- The complexity of computing the permanent
- The worst-case time complexity for generating all maximal cliques and computational experiments
Cited in
(16)- Maximal strongly connected cliques in directed graphs: algorithms and bounds
- Conformal hypergraphs: duality and implications for the upper clique transversal problem
- A linear delay algorithm in SD set system and its application to subgraph enumeration
- The complexity of dependency detection and discovery in relational databases
- Output-sensitive enumeration of maximal cliques in temporal graphs
- Enumerating minimal vertex covers and dominating sets with capacity and/or connectivity constraints
- Sublinear-space bounded-delay enumeration for massive network analytics: maximal cliques
- scientific article; zbMATH DE number 562727 (Why is no real title available?)
- On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- A linear delay algorithm of enumerating strongly-connected induced subgraphs based on SSD set system
- A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs
- Exact counting of subtrees with diameter no more than d in trees: a generating function approach
- Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- Reconfiguration of cliques in a graph
- On approximating the number of k-cliques in sublinear time
This page was built for publication: Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1987232)
