An efficient algorithm for solving pseudo clique enumeration problem

DOI10.1007/S00453-008-9238-3zbMATH Open1187.68354OpenAlexW2009723146MaRDI QIDQ848935FDOQ848935

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

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

zbMATH Keywords

clusteringalgorithmenumerationdense subgraphminingcommunity discoveringdense structuremaximum subgraphpseudo cliquequasi clique

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (13)

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

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)