Algorithmic aspects of bipartite graphs

Mihály Bakonyi and Erik M. Varness

International Journal of Mathematics and Mathematical Sciences, 1995, vol. 18, 1-6

Abstract:

We generalize previous work done by Donald J. Rose and Robert E. Tarjan [2], 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.

Date: 1995
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/18/818571.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/18/818571.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:818571

DOI: 10.1155/S0161171295000378

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().