An Efficient Algorithm for Enumerating Pseudo Cliques

DOI10.1007/978-3-540-77120-3_36MaRDI QIDQ5387774zbMATH OpenOpenAlexFDO

Authors Takeaki Uno

Publication date 27 May 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77120-3_36

zbMATH Keywords

algorithmenumerationpseudo cliques

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An efficient algorithm for solving pseudo clique enumeration problem
• On Fast Enumeration of Pseudo Bicliques
• scientific article; zbMATH DE number 4059145
• Efficient algorithms for clique problems
• Algorithm Theory - SWAT 2004
• A sufficiently fast algorithm for finding close to optimal clique trees
• Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
• Algorithms – ESA 2005
• Enumeration of isolated cliques and pseudo-cliques
• Efficiently enumerating all maximal cliques with bit-parallelism

Cites work

• Algorithm Theory - SWAT 2004
• 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
• 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 1104328 (Why is no real title available?)
• Reverse search for enumeration
• The dense \(k\)-subgraph problem
• The worst-case time complexity for generating all maximal cliques and computational experiments

Cited in

(8)

• Closed and noise-tolerant patterns in \(n\)-ary relations
• Enumeration of isolated cliques and pseudo-cliques
• On Fast Enumeration of Pseudo Bicliques
• Multi-way set enumeration in weight tensors
• A Continuous-Based Approach for Partial Clique Enumeration
• Evolutionary approach to obtain graph covering by densely connected subgraphs
• \( \gamma \)-clustering problems: classical and parametrized complexity
• An efficient algorithm for solving pseudo clique enumeration problem

This page was built for publication: An Efficient Algorithm for Enumerating Pseudo Cliques

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