THE RELATIONSHIP BETWEEN THE COMPUTATIONAL COMPLEXITIES OF THE LEGITIMATE DECK AND ISOMORPHISM PROBLEMS
From MaRDI portal
Publication:3969866
DOI10.1093/qmath/33.3.345zbMath0503.68030OpenAlexW2078437601MaRDI QIDQ3969866
Publication date: 1982
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/33.3.345
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Some recognition problems related to graph isomorphism, Complexity results in graph reconstruction, Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs, Unnamed Item, Graph theory (algorithmic, algebraic, and metric problems), The robustness of LWPP and WPP, with an application to graph reconstruction, Some Ulam’s reconstruction problems for quantum states, Combinatorial analysis (nonnegative matrices, algorithmic problems)