Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
From MaRDI portal
Publication:1597764
DOI10.1007/s00224-001-1048-9zbMath0993.68043OpenAlexW1727973222MaRDI QIDQ1597764
Jörg Rothe, André Große, Gerd Wechsung
Publication date: 30 May 2002
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-001-1048-9
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
Computing graph automorphism from partial solutions ⋮ Computational complexity of computing a partial solution for the graph automorphism problems