Enumerating maximal bicliques in bipartite graphs with favorable degree sequences

DOI10.1016/j.ipl.2014.02.001zbMath1285.05166OpenAlexW2079195756MaRDI QIDQ2446577

Peter Damaschke

Publication date: 17 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.02.001

zbMATH Keywords

analysis of algorithmspower lawdegree sequencehull operatorbiclique enumeration

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)

Related Items (4)

On Problem of Finding all Maximal Induced Bicliques of Hypergraph ⋮ Tight lower bounds on the number of bicliques in false-twin-free graphs ⋮ Efficient enumeration of maximal induced bicliques ⋮ Finding and enumerating large intersections

Cites Work

• Generating bicliques of a graph in lexicographic order
• Consensus algorithms for the generation of all maximal bicliques
• Enumeration aspects of maximal cliques and bicliques
• Algorithm Theory - SWAT 2004
• On the generation of bicliques of a graph

This page was built for publication: Enumerating maximal bicliques in bipartite graphs with favorable degree sequences