Linear-time algorithm for generating c-isolated bicliques
DOI10.1080/00207160.2016.1226498zbMATH Open1409.68199OpenAlexW2512675658MaRDI QIDQ4976342FDOQ4976342
Authors: Zareen Alamgir, Saira Karim, Syed Muhammad Husnine 
Publication date: 28 July 2017
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2016.1226498
Recommendations
Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- On independent sets and bicliques in graphs
- Isolation concepts for efficiently enumerating dense subgraphs
- Trees having many minimal dominating sets
- An efficient exact algorithm for constraint bipartite vertex cover
- Constraint bipartite vertex cover: simpler exact algorithms and implementations
- On the generation of bicliques of a graph
- Isolation concepts for clique enumeration: comparison and computational experiments
- Enumeration of isolated cliques and pseudo-cliques
- Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques
- Generating bracelets with fixed content
- The Parameterized Complexity of Enumerating Frequent Itemsets
Cited In (2)
This page was built for publication: Linear-time algorithm for generating c-isolated bicliques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976342)
