On Fast Enumeration of Pseudo Bicliques

DOI10.1007/978-3-642-19222-7_26zbMATH Open1326.05064OpenAlexW1572329961MaRDI QIDQ3000513FDOQ3000513

Authors: 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

Recommendations

• An Efficient Algorithm for Enumerating Pseudo Cliques
• Efficient enumeration of maximal induced bicliques
• An efficient algorithm for solving pseudo clique enumeration problem
• Efficient enumeration of bipartite subgraphs in graphs
• Enumeration aspects of maximal cliques and bicliques
• Approximating Clique and Biclique Problems
• Exact exponential-time algorithms for finding bicliques
• scientific article; zbMATH DE number 2081005
• Efficient enumeration of non-isomorphic Ptolemaic graphs
• Fast maximal cliques enumeration in sparse graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• An efficient algorithm for solving pseudo clique enumeration problem
• Reverse search for enumeration
• A new conceptual clustering framework

Cited In (2)

• An Efficient Algorithm for Enumerating Pseudo Cliques
• An efficient algorithm for solving pseudo clique enumeration problem

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

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