Algorithmic aspects of bipartite graphs
Summary: We generalize previous work done by \textit{D. J. Rose} and \textit{R. E. Tarjan} [SIAM J. Appl. Math. 34, 176-197 (1978; Zbl 0377.65013)], 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.
scientific article; zbMATH DE number 753687