On an algorithm of Zemlyachenko for subtree isomorphism
DOI10.1016/S0020-0190(99)00054-XzbMATH Open1339.05383OpenAlexW2040344654MaRDI QIDQ294684FDOQ294684
Michael Rodeh, Yefim Dinitz, Alon Itai
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001909900054X?np=y
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Data structures (68P05)
Cited In (13)
- Inferring a graph from path frequency
- Encoding trees by linear recurrence sequences
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species
- The saga of minimum spanning trees
- FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
- Exact algorithms for computing the tree edit distance between unordered trees
- Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming
- A bisection algorithm for grammar-based compression of ordered trees
- Some comments on the subtree isomorphism problem for ordered trees
- Cleaning interval graphs
- Further comments on the subtree isomorphism for ordered trees
- A linear time and space algorithm for finding isomorphic subtrees of a binary tree
This page was built for publication: On an algorithm of Zemlyachenko for subtree isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294684)
