Relating Complete and Partial Solution for Problems Similar to Graph Automorphism

DOI10.1007/978-3-540-74456-6_52zbMath1147.68537OpenAlexW1549832604MaRDI QIDQ3525603

Takayuki Nagoya

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_52

zbMATH Keywords

computational complexityreducibilitygraph automorphismpartial solution

Mathematics Subject Classification ID

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)

This page was built for publication: Relating Complete and Partial Solution for Problems Similar to Graph Automorphism