A new algorithm for solving the tree isomorphism problem

DOI10.1007/BF02243572MaRDI QIDQ787675zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3235858 (Why is no real title available?)
• An Efficient Algorithm for Graph Isomorphism
• The graph isomorphism disease
• The theory of tournaments: A miniature mathematical system

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787675)