Isolation concepts for clique enumeration: comparison and computational experiments

DOI10.1016/j.tcs.2009.05.008zbMath1192.68484OpenAlexW2112128622MaRDI QIDQ1040581

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

Publication date: 25 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.008

zbMATH Keywords

exact algorithmNP-hard problemfixed-parameter tractabilitydense subgraphalgorithm engineering

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes ⋮ Finding connected secluded subgraphs ⋮ Multivariate algorithmics for finding cohesive subnetworks ⋮ The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs ⋮ Unnamed Item ⋮ Linear-time algorithm for generating c-isolated bicliques

Uses Software

• Algorithm 457

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The worst-case time complexity for generating all maximal cliques and computational experiments
• A note on the problem of reporting maximal cliques
• 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
• Enumeration of isolated cliques and pseudo-cliques
• Isolation Concepts for Enumerating Dense Subgraphs
• Introduction to Econophysics
• Algorithms – ESA 2005
• Algorithm 457: finding all cliques of an undirected graph
• On cliques in graphs

This page was built for publication: Isolation concepts for clique enumeration: comparison and computational experiments