Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems (Q1145508)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems |
scientific article; zbMATH DE number 3696519
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems |
scientific article; zbMATH DE number 3696519 |
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
