Linear-time algorithm for generating c-isolated bicliques

DOI10.1080/00207160.2016.1226498zbMath1409.68199OpenAlexW2512675658MaRDI QIDQ4976342

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

zbMATH Keywords

graph algorithmscombinatorial algorithmenumeration algorithmbicliqueisolated biclique

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• Constraint bipartite vertex cover: simpler exact algorithms and implementations
• Isolation concepts for efficiently enumerating dense subgraphs
• Isolation concepts for clique enumeration: comparison and computational experiments
• Generating bracelets with fixed content
• Trees having many minimal dominating sets
• On independent sets and bicliques in graphs
• Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques
• An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
• Enumeration of isolated cliques and pseudo-cliques
• The Parameterized Complexity of Enumerating Frequent Itemsets
• On the generation of bicliques of a graph

This page was built for publication: Linear-time algorithm for generating c-isolated bicliques