Abstract
We present efficient algorithms for chordal bipartite graphs. Both algorithms use a doubly lexical ordering of the bipartite adjacency matrix. The first algorithm computes a perfect edge without vertex elimination ordering and the second one lists all maximal complete bipartite subgraphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
