Treewidth of Chordal Bipartite Graphs

T. Kloks, D. Kratsch
1995 Journal of Algorithms  
Chordal bipartite graph are exactly those bipartite graph in which every cycle of length at least six has a chord. The treewidth of a graph G is the smallest maximum cliquesize among all chordal supergraphs of G decreased by one. We present a polynomial time algorithm for the exact computation of the treewidth of all chordal bipartite graphs.
doi:10.1006/jagm.1995.1037 fatcat:zrqzyj42brdenir6atgc5bw7ha