Enumerating Isolated Cliques in Synthetic and Financial Networks

DOI10.1007/978-3-540-85097-7_38zbMath1168.05367OpenAlexW1592981318MaRDI QIDQ5505678

Rolf Niedermeier, Falk Hüffner, Hannes Moser, Christian Komusiewicz

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_38

Mathematics Subject Classification ID

Related Items (4)

Optimal decision for the market graph identification problem in a sign similarity network ⋮ Isolation concepts for efficiently enumerating dense subgraphs ⋮ Complexity and heuristics for the weighted max cut‐clique problem ⋮ Cliques with maximum/minimum edge neighborhood and neighborhood density

Cites Work

• The worst-case time complexity for generating all maximal cliques and computational experiments
• Statistical analysis of financial networks
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Enumerating all connected maximal common subgraphs in two graphs
• Efficiently covering complex networks with cliques of similar vertices
• Clique-detection models in computational biochemistry and genomics
• Mining market data: a network approach
• Isolation Concepts for Enumerating Dense Subgraphs
• Introduction to Econophysics
• Algorithms – ESA 2005
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumerating Isolated Cliques in Synthetic and Financial Networks