Enumeration of isolated cliques and pseudo-cliques
From MaRDI portal
Publication:2930266
DOI10.1145/1597036.1597044zbMath1298.05250OpenAlexW2010504820MaRDI QIDQ2930266
Publication date: 18 November 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1597036.1597044
Enumeration in graph theory (05C30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Isolation concepts for efficiently enumerating dense subgraphs, Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes, Finding connected secluded subgraphs, Multivariate algorithmics for finding cohesive subnetworks, Cliques with maximum/minimum edge neighborhood and neighborhood density, Unnamed Item, A classification for community discovery methods in complex networks, Linear-time algorithm for generating c-isolated bicliques, Isolation concepts for clique enumeration: comparison and computational experiments