A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Due to a large number of applications, bicliques of graphs have been widely considered in the literature. This paper focuses on non-induced bicliques. Given a graph G = (V, E) on n vertices, a pair (X, for any x ∈ X and y ∈ Y . The NP-complete problem of finding a non-induced (k 1 , k 2 )-biclique asks to decide whether G contains a non-induced biclique (X, Y ) such that |X| = k 1 and |Y | = k 2 . In this paper, we design a polynomial-space O(1.6914 n )time algorithm for this problem. It isdoi:10.1016/j.ipl.2010.10.020 fatcat:auug2gskdfelrpykz5mrvyswwm