The complexity of finding uniform emulations on fixed graphs
From MaRDI portal
Publication:1110329
DOI10.1016/0020-0190(88)90051-8zbMath0656.68045WikidataQ59568115 ScholiaQ59568115MaRDI QIDQ1110329
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68N25: Theory of operating systems