An efficient algorithm for solving pseudo clique enumeration problem

DOI10.1007/S00453-008-9238-3MaRDI QIDQ848935zbMATHOpenAlexFDO

Authors Takeaki Uno

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

zbMATH Keywords

clusteringalgorithmenumerationdense subgraphminingcommunity discoveringdense structuremaximum subgraphpseudo cliquequasi clique

Mathematics Subject Classification ID

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

Recommendations

• An Efficient Algorithm for Enumerating Pseudo Cliques
• Enumeration of isolated cliques and pseudo-cliques
• On Fast Enumeration of Pseudo Bicliques
• Isolation concepts for efficiently enumerating dense subgraphs
• Fast maximal cliques enumeration in sparse graphs

Cites work

• scientific article; zbMATH DE number 1263204 (Why is no real title available?)
• scientific article; zbMATH DE number 1305391 (Why is no real title available?)
• scientific article; zbMATH DE number 1934539 (Why is no real title available?)
• A Fast Parametric Maximum Flow Algorithm and Applications
• Algorithm Theory - SWAT 2004
• An Efficient Algorithm for Enumerating Pseudo Cliques
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Finding all minimum-cost perfect matchings in Bipartite graphs
• Graph-Theoretic Concepts in Computer Science
• Reverse search for enumeration
• Some simplified NP-complete graph problems
• The dense \(k\)-subgraph problem
• The worst-case time complexity for generating all maximal cliques and computational experiments

Cited in

(13)

• A linear delay algorithm for enumeration of 2-edge/vertex-connected induced subgraphs
• Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs
• Listing Maximal Subgraphs Satisfying Strongly Accessible Properties
• An Efficient Algorithm for Enumerating Pseudo Cliques
• Polynomial-delay generation of functional digraphs up to isomorphism
• Discovering subjectively interesting multigraph patterns
• Sublinear-space and bounded-delay algorithms for maximal clique enumeration in graphs
• On Fast Enumeration of Pseudo Bicliques
• Generating fixed density bracelets of arbitrary base
• Micro-review synthesis for multi-entity summarization
• Subjective interestingness of subgraph patterns
• Finding maximum subgraphs with relatively large vertex connectivity
• An ellipsoidal bounding scheme for the quasi-clique number of a graph

Describes a project that uses

Uses Software

• LCM

This page was built for publication: An efficient algorithm for solving pseudo clique enumeration problem

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