Finding all maximal cliques in dynamic graphs

DOI10.1023/B:COAP.0000008651.28952.B6MaRDI QIDQ1424782zbMATH OpenOpenAlexWikidataFDO

Authors Volker Stix

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, https://epub.wu.ac.at/1198/1/document.pdf

zbMATH Keywords

dynamic graphsfuzzy clusteringmaximal clique

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Computing maximal cliques in link streams
• Algorithm Theory - SWAT 2004
• On maximal cliques with connectivity constraints in directed graphs
• Enumerating maximal cliques in large sparse graphs
• Theoretical underpinnings for maximal clique enumeration on perturbed graphs

Cited in

(13)

• Enumerating maximal cliques in link streams with durations
• Large-scale clique cover of real-world networks
• All roads lead to Rome -- new search methods for the optimal triangulation problem
• A linear time algorithm for maximal clique enumeration in large sparse graphs
• Mining constrained cross-graph cliques in dynamic networks
• Mining preserving structures in a graph sequence
• Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata
• Representations of motivic spaces of a score inOpenMusic
• Listing all potential maximal cliques of a graph
• On atomic cliques in temporal graphs
• Faster maximal clique enumeration in large real-world link streams
• Computing maximal cliques in link streams
• Theoretical underpinnings for maximal clique enumeration on perturbed graphs

Describes a project that uses

Uses Software

• DIMACS
• ClaiMaker

This page was built for publication: Finding all maximal cliques in dynamic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424782)