COMPUTING A PERFECT EDGE WITHOUT VERTEX-ELIMINATION ORDERING OF A CHORDAL BIPARTITE GRAPH

Authors
KLOKS T KRATSCH D
Citation
T. Kloks et D. Kratsch, COMPUTING A PERFECT EDGE WITHOUT VERTEX-ELIMINATION ORDERING OF A CHORDAL BIPARTITE GRAPH, Information processing letters, 55(1), 1995, pp. 11-16
Citations number
12
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
55
Issue
1
Year of publication
1995
Pages
11 - 16
Database
ISI
SICI code
0020-0190(1995)55:1<11:CAPEWV>2.0.ZU;2-#
Abstract
We present efficient algorithms for chordal bipartite graphs. Both alg orithms use a doubly lexical ordering of the bipartite adjacency matri x. The first algorithm computes a perfect edge without vertex eliminat ion ordering and the second one lists all maximal complete bipartite s ubgraphs.