An Efficient Algorithm for Enumerating Pseudo Cliques

DOI10.1007/978-3-540-77120-3_36zbMath1193.05155OpenAlexW1489695743MaRDI QIDQ5387774

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

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

Related Items

Closed and noise-tolerant patterns in \(n\)-ary relations, An efficient algorithm for solving pseudo clique enumeration problem, Multi-way set enumeration in weight tensors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The worst-case time complexity for generating all maximal cliques and computational experiments
• Reverse search for enumeration
• Finding all minimum-cost perfect matchings in Bipartite graphs
• Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
• Algorithm Theory - SWAT 2004
• Graph-Theoretic Concepts in Computer Science
• The dense \(k\)-subgraph problem