Complexity of a 3-dimensional assignment problem (Q1837625): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q57401637, #quickstatements; #temporary_batch_1706881316814 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q57401637 / rank | |||
Normal rank | |||
Revision as of 16:09, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of a 3-dimensional assignment problem |
scientific article |
Statements
Complexity of a 3-dimensional assignment problem (English)
0 references
1983
0 references
3-dimensional assignment problem
0 references
bipartite graphs
0 references
perfect matchings
0 references
computational complexity
0 references
NP-completeness
0 references
