The complexity of finding uniform emulations on paths and ring networks (Q918210)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4157887
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of finding uniform emulations on paths and ring networks |
scientific article; zbMATH DE number 4157887 |
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
0 references
0.902961254119873
0 references
0.8295415639877319
0 references
0.8255576491355896
0 references
0.7347521781921387
0 references
0.714623212814331
0 references
