The complexity of finding uniform emulations on fixed graphs (Q1110329)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of finding uniform emulations on fixed graphs |
scientific article; zbMATH DE number 4072378
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding uniform emulations on fixed graphs |
scientific article; zbMATH DE number 4072378 |
Statements
The complexity of finding uniform emulations on fixed graphs (English)
0 references
1988
0 references
Uniform emulations are a method to obtain efficient and structure- preserving simulations of large networks on smaller networks. We show that for every fixed graph H, which is connected (or strongly) connected in the case of directed graphs) but not complete, the problem to decide whether another (strongly) connected graph G can be uniformly emulated on H is NP-complete.
0 references
parallel computing
0 references
simulations of networks
0 references
Uniform emulations
0 references
NP- complete
0 references
