International Journal of Mathematics and Mathematical Sciences
Volume 18 (1995), Issue 2, Pages 299-304
We generalize previous work done by Donald J. Rose and Robert E. Tarjan ,
who developed efficient algorithms for use on directed graphs. This paper considers an edge
elimination process on bipartite graphs, presenting several theorems which lead to an algorithm
for computing the minimal fill-in of a given ordered graph.