Exact exponential-time algorithms for finding bicliques
From MaRDI portal
Publication:1944039
DOI10.1016/j.ipl.2010.10.020zbMath1259.05160MaRDI QIDQ1944039
Henning Fernau, Serge Gaspers, Mathieu Liedloff, Daniel Binkele-Raible
Publication date: 4 April 2013
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.10.020
bicliques; graph algorithms; NP-hard problem; exact exponential-time algorithms; complete bipartite subgraphs
68W40: Analysis of algorithms
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)