An algorithm for computing the matching capacity (Q2484637)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for computing the matching capacity |
scientific article |
Statements
An algorithm for computing the matching capacity (English)
0 references
1 August 2005
0 references
The author has studied an iterative method of computing the matching capacity of a bipartite graph in which each vertex of degree two or more is adjacent to at least one vertex of degree one. Further, the author has proved its exponentially fast convergence.
0 references
