Algorithmic aspects of bipartite graphs
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 o...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
1995-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S0161171295000378 |
| Summary: | 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. |
|---|---|
| ISSN: | 0161-1712 1687-0425 |