Finding all maximal cliques in dynamic graphs
From MaRDI portal
Publication:1424782
DOI10.1023/B:COAP.0000008651.28952.b6zbMath1045.90053OpenAlexW2040420521WikidataQ59409906 ScholiaQ59409906MaRDI QIDQ1424782
Publication date: 15 March 2004
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:coap.0000008651.28952.b6
Related Items (6)
A linear time algorithm for maximal clique enumeration in large sparse graphs ⋮ All roads lead to Rome -- new search methods for the optimal triangulation problem ⋮ Mining preserving structures in a graph sequence ⋮ Theoretical underpinnings for maximal clique enumeration on perturbed graphs ⋮ Representations of motivic spaces of a score inOpenMusic ⋮ Large-scale clique cover of real-world networks
Uses Software
This page was built for publication: Finding all maximal cliques in dynamic graphs
