A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:52, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for maximum matchings in convex, bipartite graphs |
scientific article |
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
