Refined pivot selection for maximal clique enumeration in graphs
From MaRDI portal
Publication:899307
DOI10.1016/J.TCS.2015.11.016zbMATH Open1333.05147OpenAlexW2180361393MaRDI QIDQ899307FDOQ899307
Authors: Kevin A. Naudé 
Publication date: 28 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.11.016
Recommendations
- The worst-case time complexity for generating all maximal cliques and computational experiments
- A note on the problem of reporting maximal cliques
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
- An algorithm for finding a maximum clique in a graph
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Enumeration in graph theory (05C30)
Cites Work
- Mersenne twister
- Algorithm 457: finding all cliques of an undirected graph
- Title not available (Why is that?)
- On cliques in graphs
- Clique-detection models in computational biochemistry and genomics
- A note on the problem of reporting maximal cliques
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Listing all maximal cliques in sparse graphs in near-optimal time
- Enumerating all connected maximal common subgraphs in two graphs
- An algorithm for reporting maximal \(c\)-cliques
Cited In (5)
- On comparing algorithms for the maximum clique problem
- A Continuous-Based Approach for Partial Clique Enumeration
- On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Efficiently enumerating all maximal cliques with bit-parallelism
Uses Software
This page was built for publication: Refined pivot selection 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 Q899307)
