Algorithmic aspects of bipartite graphs (Q1805124): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:44, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithmic aspects of bipartite graphs |
scientific article |
Statements
Algorithmic aspects of bipartite graphs (English)
0 references
11 May 1995
0 references
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.
0 references
Gaussian elimination
0 references
edge elimination process
0 references
bipartite graphs
0 references
