A BULT algorithm for tree isomorphism

MaRDI QIDQ5483829zbMATH OpenFDO

Authors Xuelian Wen, Huajin Liang

Publication date 23 August 2006

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1088188
• Faster Subtree Isomorphism
• scientific article; zbMATH DE number 3885345
• An algorithm for testing an isomorphism for Husimi trees.
• Faster algorithms for the maximum common subtree isomorphism problem

Cited in

(5)

• Pruning by isomorphism in branch-and-cut
• scientific article; zbMATH DE number 3885345 (Why is no real title available?)
• A linear time and space algorithm for finding isomorphic subtrees of a binary tree
• scientific article; zbMATH DE number 1757963 (Why is no real title available?)
• scientific article; zbMATH DE number 871916 (Why is no real title available?)

This page was built for publication: A BULT algorithm for tree isomorphism

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