An algorithm for computing the matching capacity (Q2484637)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2189626
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for computing the matching capacity |
scientific article; zbMATH DE number 2189626 |
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
0.782288670539856
0 references
0.7606465220451355
0 references
0.7595754265785217
0 references
0.756754994392395
0 references
