𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new algorithm for solving the tree isomorphism problem

✍ Scribed by A. Jovanović; D. Danilović

Publisher
Springer Vienna
Year
1984
Tongue
English
Weight
549 KB
Volume
32
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New Algorithm for Ordered Tree-to-Tree C
New Algorithm for Ordered Tree-to-Tree Correction Problem
✍ Weimin Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 179 KB

number of leaves of S and D D denotes the depth of S. The previous best S Ž< < < < Ä 4 Ä 4 . Ž algorithms for this problem run in O S T min L L , D D min L L , D D time K.

A New Algorithm for Solving the Word Pro
A New Algorithm for Solving the Word Problem in Braid Groups
✍ D. Garber; S. Kaplan; M. Teicher 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 148 KB

One of the most interesting questions about a group is whether its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists, and geometers, and is the target of intensive current research. We look at the braid group from a topologi