Tree Isomorphism Algorithms: Speed vs. Clarity

DOI10.2307/2690833zbMath0800.68449OpenAlexW4242361621MaRDI QIDQ4009605

David E. Radford, Douglas Michael Campbell

Publication date: 27 September 1992

Full work available at URL: https://doi.org/10.2307/2690833

zbMATH Keywords

rootsedgesvertexgraph isomorphismtree isomorphismisomorphism algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

String representation of trivalent 2-stratifolds with trivial fundamental group ⋮ On the homeomorphism problem of trivalent 2-stratifolds with finite homology groups ⋮ Unnamed Item ⋮ Bounds of the sum of edge lengths in linear arrangements of trees

This page was built for publication: Tree Isomorphism Algorithms: Speed vs. Clarity