Efficient nondestructive equality checking for trees and graphs
Abstract
Supplementary Material
- Download
- 13.78 KB
- Download
- .98 KB
- Download
- 8.78 MB
- Download
- 10.67 MB
- Download
- 146.93 MB
References
Index Terms
- Efficient nondestructive equality checking for trees and graphs
Recommendations
Efficient nondestructive equality checking for trees and graphs
ICFP '08The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equivalence or union-find algorithm, these algorithms usually require an ...
Experiments on union-find algorithms for the disjoint-set data structure
SEA'10: Proceedings of the 9th international conference on Experimental AlgorithmsThe disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structure are often referred to as Union-Find algorithms. They are used in numerous ...
Efficient union-find for planar graphs and other sparse graph classes
Special issue: graph theoretic concepts in computer science
Comments
Information & Contributors
Information
Published In

Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Upcoming Conference
- Sponsor:
- sigplan
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 423Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in