The complexity of matching with bonds (Q1123620): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4099676 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Matching, Euler tours and the Chinese postman / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some Matching Problems for Bipartite Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3048571 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of restricted spanning tree problems / rank | |||
Normal rank | |||
Latest revision as of 10:09, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of matching with bonds |
scientific article |
Statements
The complexity of matching with bonds (English)
0 references
1989
0 references
computational complexity
0 references
restricted matching problems
0 references
Matching with bonds
0 references
maximum-weight matching
0 references
NP-hard problem
0 references
