A new algorithm for solving the tree isomorphism problem

DOI10.1007/BF02243572zbMath0529.68038OpenAlexW193925929MaRDI QIDQ787675

N. E. Zubov

Publication date: 1984

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02243572

zbMATH Keywords

efficient algorithm for canonical coding of unlabelled trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees ⋮ On the subtree isomorphism problem for ordered trees ⋮ New terminology and results for AVL trees ⋮ Linear time tree codes

Cites Work

• Unnamed Item
• The graph isomorphism disease
• The theory of tournaments: A miniature mathematical system
• An Efficient Algorithm for Graph Isomorphism

This page was built for publication: A new algorithm for solving the tree isomorphism problem