DMCA
Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization (1997)
Cached
Download Links
- [euclid.ucsd.edu]
- [euclid.ucsd.edu]
- [euclid.ucsd.edu]
- [math.ucsd.edu]
- [www.math.ucsd.edu]
- [www.math.ucsd.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Computational Logic and Proof Theory, 5th Kurt Godel Colloquium'97, Lecture Notes in Computer Science #1289 |
| Citations: | 21 - 0 self |
BibTeX
@INPROCEEDINGS{Buss97alogtimealgorithms,
author = {Samuel R. Buss},
title = {Alogtime Algorithms for Tree Isomorphism, Comparison, and Canonization},
booktitle = {In Computational Logic and Proof Theory, 5th Kurt Godel Colloquium'97, Lecture Notes in Computer Science #1289},
year = {1997},
pages = {18--33},
publisher = {Springer-Verlag}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
The tree isomorphism problem is the problem of determining whether two trees are isomorphic. The tree canonization problem is the problem of producing a canonical tree isomorphic to a given tree. The tree comparison problem is the problem of determining whether one tree is less than a second tree in a natural ordering on trees. We present alternating logarithmic time algorithms for the tree isomorphism problem, the tree canonization problem and the tree comparison problem. As a consequence, there is a recursive enumeration of the alternating log time tree problems.
