A unifying method for the design of algorithms canonizing combinatorial objects
From MaRDI portal
Publication:5212863
DOI10.1145/3313276.3316338zbMath1433.68640arXiv1806.07466OpenAlexW2963932822MaRDI QIDQ5212863
Daniel Wiebking, Pascal Schweitzer
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://arxiv.org/abs/1806.07466
Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (6)
Isomorphism Testing for Graphs Excluding Small Minors ⋮ Towards Efficient Normalizers of Primitive Groups ⋮ Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract) ⋮ Computing Autotopism Groups of Partial Latin Rectangles ⋮ Isomorphism Testing Parameterized by Genus and Beyond ⋮ Testing isomorphism of circulant objects in polynomial time
This page was built for publication: A unifying method for the design of algorithms canonizing combinatorial objects
