On Fast Enumeration of Pseudo Bicliques

DOI10.1007/978-3-642-19222-7_26zbMath1326.05064OpenAlexW1572329961MaRDI QIDQ3000513

Zareen Alamgir, Saira Karim, Syed Muhammad Husnine

Publication date: 19 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_26

Mathematics Subject Classification ID

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

Cites Work

• A new conceptual clustering framework
• An efficient algorithm for solving pseudo clique enumeration problem
• Reverse search for enumeration
• Unnamed Item

This page was built for publication: On Fast Enumeration of Pseudo Bicliques