Listing all maximal cliques in sparse graphs in near-optimal time
From MaRDI portal
Publication:3060751
Recommendations
- Listing all maximal cliques in large sparse real-world graphs
- An output sensitive algorithm for maximal clique enumeration in sparse graphs
- A new decomposition technique for maximal clique enumeration for sparse graphs
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
- Fast maximal cliques enumeration in sparse graphs
Cited in
(41)- Finding cliques in social networks: a new distribution-free model
- Sublinear time estimation of degree distribution moments: the arboricity connection
- Exploiting the formation of maximal cliques in social networks
- Why is maximum clique often easy in practice?
- A linear time algorithm for maximal clique enumeration in large sparse graphs
- Local community detection based on small cliques
- A note on the problem of reporting maximal cliques
- A new decomposition technique for maximal clique enumeration for sparse graphs
- Core decomposition, maintenance and applications
- A two-level graph partitioning problem arising in mobile wireless communications
- Detecting capital market convergence clubs
- Testing One Hypothesis Multiple Times: The Multidimensional Case
- Finding cliques in social networks: a new distribution-free model
- Sparsity measure of a network graph: Gini index
- Maximal independent sets in clique-free graphs
- An improved upper bound on maximal clique listing via rectangular fast matrix multiplication
- On the parameterized complexity of non-hereditary relaxations of clique
- Parameterized leaf power recognition via embedding into graph products
- Arboricity and Subgraph Listing Algorithms
- Faster maximal clique enumeration in large real-world link streams
- Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
- Parallel maximum clique algorithms with applications to network analysis
- Computing and Combinatorics
- A color-avoiding approach to subgraph counting in bounded expansion classes
- Discovering the hidden community structure of public transportation networks
- Faster algorithms for counting subgraphs in sparse graphs
- scientific article; zbMATH DE number 1500539 (Why is no real title available?)
- Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks
- Listing all fixed-length simple cycles in sparse graphs in optimal time
- Refined pivot selection for maximal clique enumeration in graphs
- Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model
- An output sensitive algorithm for maximal clique enumeration in sparse graphs
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Fast maximal cliques enumeration in sparse graphs
- Enumerating all maximal biclusters in numerical datasets
- Building efficient and compact data structures for simplicial complexes
- Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network
- Listing all maximal cliques in large sparse real-world graphs
- Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
- Efficient enumeration of maximal \(k\)-degenerate subgraphs in a chordal graph
This page was built for publication: Listing all maximal cliques in sparse graphs in near-optimal time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060751)
