Isomorphism testing for embeddable graphs through definability
From MaRDI portal
Publication:3191972
DOI10.1145/335305.335313zbMath1296.05134OpenAlexW2024420212MaRDI QIDQ3191972
Publication date: 26 September 2014
Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/335305.335313
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (13)
Minimum Cuts in Surface Graphs ⋮ Succinct definitions in the first order theory of graphs ⋮ The first order definability of graphs: Upper bounds for quantifier depth ⋮ CFI Construction and Balanced Graphs ⋮ Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements ⋮ From Invariants to Canonization in Parallel ⋮ Counting and sampling minimum cuts in genus \(g\) graphs ⋮ Hashing and canonicalizing Notation 3 graphs ⋮ Unnamed Item ⋮ Permutation group approach to association schemes ⋮ The first order definability of graphs with separators via the Ehrenfeucht game ⋮ Unnamed Item ⋮ Canonisation and Definability for Graphs of Bounded Rank Width
This page was built for publication: Isomorphism testing for embeddable graphs through definability
