A BULT algorithm for tree isomorphism

zbMATH Open1115.68466MaRDI QIDQ5483829FDOQ5483829

Authors: Xuelian Wen, Huajin Liang 

Publication date: 23 August 2006

Recommendations

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

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)

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Pruning by isomorphism in branch-and-cut
• Title not available (Why is that?)
• A linear time and space algorithm for finding isomorphic subtrees of a binary tree

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)