Logical Approaches to Computational Barriers
From MaRDI portal
Publication:5898822
DOI10.1007/11780342zbMath1145.68435WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898822
Publication date: 30 April 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11780342
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
Related Items
Distributed Testing of Graph Isomorphism in the CONGEST Model., Computational complexity of reconstruction and isomorphism testing for designs and line graphs, Graph matching using the interference of continuous-time quantum walks, The journey of graph kernels through two decades, Colored hypergraph isomorphism is fixed parameter tractable, Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$^1$}$, On the Complexity of Matroid Isomorphism Problems