Algorithmic aspects of bipartite graphs
type: Item
instance of: scholarly article
title: Algorithmic aspects of bipartite graphs
zbMATH Open document ID: 0822.68077
DOI: 10.1155/S0161171295000378
author: Mihály Bakonyi
author: Erik M. Varness
published in: International Journal of Mathematics and Mathematical Sciences
publication date: 1995-05-11T00:00:00Z
full work available at URL: https://eudml.org/doc/47261
review text: 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.
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 753687
zbMATH Keywords: Gaussian elimination
zbMATH Keywords: edge elimination process
zbMATH Keywords: bipartite graphs
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 753687