论文信息 - Intersection Reporting on Two Collections of Disjoint Sets

Intersection Reporting on Two Collections of Disjoint Sets

In this paper we introduce a new quick-find data structure to represent disjoint sets, called binomial list, showing that it has a better single-operation worst case time complexity than any previously known approach in solving the set union and intersection problem, a variant of the classical disjoint set union problem.

[1] Vijay A. Saraswat,et al. Concurrent constraint programming , 1989, POPL '90.

[2] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .

[3] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[4] Jean Vuillemin,et al. A data structure for manipulating priority queues , 1978, CACM.

[5] Robert E. Tarjan,et al. A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets , 1979, J. Comput. Syst. Sci..

[6] Zvi Galil,et al. Data structures and algorithms for disjoint set union problems , 1991, CSUR.

[7] Jan van Leeuwen,et al. Worst-case Analysis of Set Union Algorithms , 1984, JACM.

[8] Michael J. Maher,et al. Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[9] Ralf Hartmut Güting,et al. An introduction to spatial database systems , 1994, VLDB J..

[10] Dana S. Scott,et al. Concurrent constraint programming languages , 1989 .

[11] Norbert Blum,et al. On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem , 1986, SIAM J. Comput..

[12] Jacques Cohen,et al. Constraint logic programming languages , 1990, CACM.