A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:16, 5 March 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
