Complexity of Finding Uniform Emulations on Fixed Graphs

摘要

Uniform emulations are a method to obtain efficient and structure preserving simulations of large networks on smaller networks. The authors show that for every fixed graph H, that 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.