The complexity of finding uniform emulations on fixed graphs

DOI10.1016/0020-0190(88)90051-8zbMath0656.68045DBLPjournals/ipl/Bodlaender88aOpenAlexW2126696635WikidataQ59568115 ScholiaQ59568115MaRDI QIDQ1110329

Hans L. Bodlaender

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/16278

zbMATH Keywords

parallel computingNP- completesimulations of networksUniform emulations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)

Related Items (2)

The complexity of finding uniform emulations on paths and ring networks ⋮ On tree-partition-width

Cites Work

• Unnamed Item
• Unnamed Item
• Simulation of large networks on smaller networks
• Quotient Networks

This page was built for publication: The complexity of finding uniform emulations on fixed graphs