An efficient algorithm for solving pseudo clique enumeration problem
From MaRDI portal
Publication:848935
DOI10.1007/s00453-008-9238-3zbMath1187.68354OpenAlexW2009723146MaRDI QIDQ848935
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-008-9238-3
algorithmclusteringenumerationdense subgraphminingcommunity discoveringdense structuremaximum subgraphpseudo cliquequasi clique
Related Items (11)
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs ⋮ Finding maximum subgraphs with relatively large vertex connectivity ⋮ Subjective interestingness of subgraph patterns ⋮ A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs ⋮ Discovering subjectively interesting multigraph patterns ⋮ Listing Maximal Subgraphs Satisfying Strongly Accessible Properties ⋮ On Fast Enumeration of Pseudo Bicliques ⋮ Micro-review synthesis for multi-entity summarization ⋮ Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs ⋮ An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph ⋮ Generating fixed density bracelets of arbitrary base
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The worst-case time complexity for generating all maximal cliques and computational experiments
- Some simplified NP-complete graph problems
- Reverse search for enumeration
- Finding all minimum-cost perfect matchings in Bipartite graphs
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
- A Fast Parametric Maximum Flow Algorithm and Applications
- Algorithm Theory - SWAT 2004
- An Efficient Algorithm for Enumerating Pseudo Cliques
- Graph-Theoretic Concepts in Computer Science
- The dense \(k\)-subgraph problem
This page was built for publication: An efficient algorithm for solving pseudo clique enumeration problem
