Linear-time algorithm for generating c-isolated bicliques

DOI10.1080/00207160.2016.1226498MaRDI QIDQ4976342zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph algorithmscombinatorial algorithmenumeration algorithmbicliqueisolated biclique

Mathematics Subject Classification ID

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)

Recommendations

• Algorithms – ESA 2005
• Efficient enumeration of maximal induced bicliques
• Consensus algorithms for the generation of all maximal bicliques
• Algorithm Theory - SWAT 2004
• On independent sets and bicliques in graphs

Cites work

• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• An efficient exact algorithm for constraint bipartite vertex cover
• Cluster-C, an algorithm for the large-scale clustering of protein sequences based on the extraction of maximal cliques
• Constraint bipartite vertex cover: simpler exact algorithms and implementations
• Enumeration of isolated cliques and pseudo-cliques
• Generating bracelets with fixed content
• Isolation concepts for clique enumeration: comparison and computational experiments
• Isolation concepts for efficiently enumerating dense subgraphs
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• On independent sets and bicliques in graphs
• On the generation of bicliques of a graph
• The Parameterized Complexity of Enumerating Frequent Itemsets
• Trees having many minimal dominating sets

Cited in

(3)

• Algorithms – ESA 2005
• Consensus algorithms for the generation of all maximal bicliques
• A biclique approach to reference anchored gene blocks and its applications to pathogenicity islands

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)