Skip to content

The complexity of finding uniform emulations on fixed graphs

Citations of this article
Mendeley users who have this article in their library.
Get full text


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. © 1988.




Bodlaender, H. L. (1988). The complexity of finding uniform emulations on fixed graphs. Information Processing Letters, 29(3), 137–141.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free