The complexity of finding uniform emulations on paths and ring networks (Q918210): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q59568073, #quickstatements; #temporary_batch_1705514146057 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q59568073 / rank | |||
Normal rank |
Revision as of 19:05, 17 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of finding uniform emulations on paths and ring networks |
scientific article |
Statements
The complexity of finding uniform emulations on paths and ring networks (English)
0 references
1990
0 references
termed emulation
0 references
connected graph
0 references
NP-complete
0 references