Refined pivot selection for maximal clique enumeration in graphs

DOI10.1016/j.tcs.2015.11.016zbMath1333.05147OpenAlexW2180361393MaRDI QIDQ899307

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

zbMATH Keywords

maximal cliquesmaximal independent setsclique enumeration

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Efficiently enumerating all maximal cliques with bit-parallelism ⋮ On comparing algorithms for the maximum clique problem ⋮ On the overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms

Uses Software

• MersenneTwister
• Algorithm 457

Cites Work

• An algorithm for reporting maximal \(c\)-cliques
• The worst-case time complexity for generating all maximal cliques and computational experiments
• A note on the problem of reporting maximal cliques
• Enumerating all connected maximal common subgraphs in two graphs
• Clique-detection models in computational biochemistry and genomics
• Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
• Mersenne twister
• Algorithm 457: finding all cliques of an undirected graph
• On cliques in graphs
• Unnamed Item

This page was built for publication: Refined pivot selection for maximal clique enumeration in graphs