Canonical form for graphs in quasipolynomial time: preliminary report
From MaRDI portal
Publication:5212862
DOI10.1145/3313276.3316356zbMath1433.68165OpenAlexW2951311167MaRDI QIDQ5212862
Publication date: 30 January 2020
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3313276.3316356
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus, Computing Autotopism Groups of Partial Latin Rectangles, Quasipolynomiality of the Smallest Missing Induced Subgraph, A Generic Framework for Engineering Graph Canonization Algorithms