A shortest augmenting path method for solving minimal perfect matching problems (Q3931440): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230110407 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058494699 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Paths, Trees, and Flowers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3921016 / rank | |||
Normal rank | |||
Latest revision as of 14:31, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A shortest augmenting path method for solving minimal perfect matching problems |
scientific article |
Statements
A shortest augmenting path method for solving minimal perfect matching problems (English)
0 references
1981
0 references
matching
0 references
shortest augmenting paths
0 references
