Fakultät für Informatik der Technischen Universität MünchenLehrstuhl für Effiziente Algorithmen |
![]() |
| Tree Isomorphism Algorithms with time complexity O(n) | |
| Tree Isomorphism Algorithms | |
| Suffix Trees | |
| Pattern Matching in Trees | |
| Minimum Spanning Trees | |
| Enumerating Labeled Trees | |
| The Least Common Ancestor Problem | |
| Bounded Treewidth Graphs - A Survey | |
| Trees for Sets |