M. de Berg, M. Overmars, and M. van Kreveld. Finding complete bipartite subgraphs in bipartite graphs. ALCOM: Algorithms Review, Newsletter of the ESPRIT II Basic Research Actions Program Project no. 3075 (ALCOM), 1, 1990. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
ArchE: A Graph Drawing System for Archaeology - Christoph Hundack Petra (1997) (Correct)
....try to minimize k; ie, the number of covering bipartite subgraphs. As these problems are NP hard, NP complete respectively, we have implemented heuristics (for details on edge concentration compare [8] Additionally ArchE includes an algorithm for finding small complete bipartite subgraphs (see [3]) as the existing complete bipartite subgraphs often possess only few vertices. 4 The main layout procedure uses extensions of the Sugiyama algorithm [11] which consists of three phases. First using topological sort, we determine the vertical order of the vertices (contemporary vertices are ....
M. de Berg, M. Overmars, and M. van Kreveld. Finding complete bipartite subgraphs in bipartite graphs. ALCOM: Algorithms Review, Newsletter of the ESPRIT II Basic Research Actions Program Project no. 3075 (ALCOM), 1, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC