A linear time and space algorithm for finding isomorphic subtrees of a binary tree

DOI10.1007/BF01931294zbMath0726.68045MaRDI QIDQ802874

Erkki Maekinen

Publication date: 1991

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

binary treeisomorphic subtrees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05)

Related Items (1)

Optimal binary search trees

Cites Work

• Unnamed Item
• The complexity of drawing trees nicely
• A numbering system for binary trees

This page was built for publication: A linear time and space algorithm for finding isomorphic subtrees of a binary tree