Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems (Q1145508): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:10, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems |
scientific article |
Statements
Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems (English)
0 references
1981
0 references
maximum matchings
0 references
convex bipartite graphs
0 references
maximum independent set
0 references
greedy algorithms
0 references
Gale-optimal matching
0 references
scheduling algorithms
0 references
