A new algorithm for solving the tree isomorphism problem

DOI10.1007/BF02243572zbMATH Open0529.68038OpenAlexW193925929MaRDI QIDQ787675FDOQ787675

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

• The graph isomorphism disease
• An Efficient Algorithm for Graph Isomorphism
• Title not available (Why is that?)
• The theory of tournaments: A miniature mathematical system

Cited In (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

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)