Homeomorphism of 2-Complexes is Graph Isomorphism Complete

DOI10.1137/S0097539791198900zbMath0818.57002OpenAlexW2013131642MaRDI QIDQ4286232

John Shawe-Taylor, Tomaž Pisanski

Publication date: 27 March 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539791198900

zbMATH Keywords

graph isomorphism2- complex homeomorphismcomplexity class of ISOMORPHISM-complete problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Triangulating manifolds (57Q15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Aspects of topology, genus and isomerism in closed 3-valent networks ⋮ On the isomorphism of expressions ⋮ Drawing graphs by eigenvectors: theory and practice

This page was built for publication: Homeomorphism of 2-Complexes is Graph Isomorphism Complete