Algorithmic aspects of bipartite graphs (Q1805124)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithmic aspects of bipartite graphs |
scientific article; zbMATH DE number 753687
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic aspects of bipartite graphs |
scientific article; zbMATH DE number 753687 |
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
0.8017624020576477
0 references
0.7992013692855835
0 references
0.7753123044967651
0 references
0.7744203209877014
0 references
0.7732312083244324
0 references
