The worst-case time complexity for generating all maximal cliques
From MaRDI portal
Recommendations
- The worst-case time complexity for generating all maximal cliques and computational experiments
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- Listing all maximal cliques in sparse graphs in near-optimal time
- Listing all maximal cliques in large sparse real-world graphs
- Finding a Maximum Clique in an Arbitrary Graph
Cited in
(10)- The maximum clique problem
- Interval vertex-coloring of a graph with forbidden colors
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- Worst-case analysis of clique MIPs
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
- A survey on enhanced subspace clustering
- All 2-planar graphs having the same spanning subgraph
- Community detection in large-scale networks: a survey and empirical evaluation
- Finding pseudoperipheral nodes in graphs
- The worst-case time complexity for generating all maximal cliques and computational experiments
This page was built for publication: The worst-case time complexity for generating all maximal cliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4681173)