WEA 2010 - PDF Preprint Papers

WEA 2010 International Workshop on Experimental and E cient Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed WEA-2010 Paper

click to vote

WEA
2010
Springer

545views Algorithms» more WEA 2010»

Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure

14 years 7 months ago

Download folk.uib.no

Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a ﬁnite universe. Algorithms that operate on this data structu...

Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	545	Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure	claim
2	476	Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments	claim
3	397	A New Combinational Logic Minimization Technique with Applications to Cryptology	claim
4	344	Alternative Routes in Road Networks	claim
5	338	New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery	claim
6	330	Exact Bipartite Crossing Minimization under Tree Constraints	claim
7	316	Modularity-Driven Clustering of Dynamic Graphs	claim
8	311	Geometric Minimum Spanning Trees with GeoFilterKruskal	claim
9	311	Realtime Classification for Encrypted Traffic	claim
10	300	Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem	claim
11	289	Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs	claim
12	284	Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems	claim
13	281	Distributed Time-Dependent Contraction Hierarchies	claim
14	280	Practical Nearest Neighbor Search in the Plane	claim
15	250	Randomized Rounding for Routing and Covering Problems: Experiments and Improvements	claim
16	245	Contraction of Timetable Networks with Realistic Transfers	claim
17	243	Experiments with a Feasibility Pump Approach for Nonconvex MINLPs	claim
18	241	A Branch-and-Price Algorithm for Multi-mode Resource Leveling	claim
19	208	Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries	claim
20	205	Practical Compressed Suffix Trees	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers