Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems (Q1145508): Difference between revisions
From MaRDI portal
Removed claims |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / author | |||
| Property / author: Witold jun. Lipski / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Franco P. Preparata / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 02:21, 5 March 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
