A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260)
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 915158
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time algorithm for maximum matchings in convex, bipartite graphs |
scientific article; zbMATH DE number 915158 |
Statements
A linear time algorithm for maximum matchings in convex, bipartite graphs (English)
0 references
25 November 1996
0 references
maximum matching
0 references
convex bipartite graph
0 references
0 references
0.93183315
0 references
0.9318315
0 references
0.9228734
0 references
0.9192747
0 references
0.9192747
0 references
0.9176234
0 references
0.9147836
0 references
0.91266996
0 references
0.9085224
0 references
