Maintaining Information in Fully Dynamic Trees with Top Trees

ACM Transactions on Algorithms

Volumn 1, Issue 2, 2005, Pages 243-264

  Alstrup, Stephen ^a   Holm, Jacob ^b   Lichtenberg, Kristian De ^c   Thorup, Mikkel ^d  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b Improva ApS   (Denmark)

^c AT & T Labs—Research ^*

^d AT AND T LABS RESEARCH   (United States)

Author keywords

Algorithms; Design; Fully dynamic forest; Theory

Indexed keywords

EID: 33748108785     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1103963.1103966     Document Type: Article

References (20)

1. 2004. Further properties of the stable multiple activities algorithm. In preparation.
2. Cechlarova, K., and Na Ferkova, S. 2004. The stable crews problem. Discrete Appl. Math. 140, 1-3, 1-17.
3. Feder, T. 1992. A new fixed point approach for stable networks and stable marriages. J. Comput. Syst. Sci. 45, 2, 233-284.
4. Fleiner, T. 2002a. Onthestable b-matching polytope. Tech. Rep. TR-2002-3, EGRES ISSN 1587-4451.
5. Fleiner, T. 2002b. Some results on stable matchings and fixed points. Tech. Rep. TR-2002-8, EGRES ISSN 1587-4451. Available at http://www.cs.elte.hu/egres.
6. Fleiner, T. 2003. A fixed-point approach to stable matchings and some applications. Math. Oper. Res. 28, 1, 103-126.
7. Gale, D., and Shapley, L. S. 1962. College admissions and stability of marriage. Amer. Math. Monthly 69, 1, 9-15.
8. Gusfield, D., and Irving, R. W. 1989. The Stable Marriage Problem: Structure and Algorithms. MIT Press, Cambridge, MA.
9. Irving, R. W. 1985. An efficient algorithm for the “stable roommates” problem. J. Algor. 6, 4, 577-595.
10. IRVING, R. W., and Manlove, D. F. 2002. The stable roommates problem with ties. J. Algor. 43, 1, 85-105.
11. Irving, R. W., and Scott, S. 2003. An algorithm for the stable fixtures problem. Submitted.
12. Roth, A. E., and Sotomayor, M. A. O. 1990. Two-Sided Matching. Cambridge University Press, Cambridge, UK. A Study in Game-Theoretic Modeling and Analysis.
13. Rothblum, U. G. 1992. Characterization of stable matchings as extreme points of a polytope. Math. Prog. 54, 1, Ser A, 57-67.
14. Sethuraman, J., and Teo, C.-P. 2001. A polynomial-time algorithm for the bistable roommates problem. J. Comput. Syst. Sci. 63, 3, 486-497.
15. Subramanian, A. 1994. A new approach to stable matching problems. SIAMJ. Comput. 23, 4, 671-700.
16. Tan, J. J. M. 1991. A necessary and sufficient condition for the existence of a complete stable matching. J. Algor. 12, 1, 154-178.
17. Tan, J. J. M., and Hsueh, Y. C. 1995. A generalization of the stable matching problem. Discrete Appl. Math. 59, 1, 87-102.
18. Teo, C.-P., Qian, L., and Sethuraman, J. 2002. The geometry of fractional solutions to stable admissions problem and its applications. Unpublished.
19. Valova, V. 2004. The stable multiple activities problem. Master's thesis. UPJS, Kosice.
20. Weems, B. p. 1999. Bistable versions of the marriages and roommates problems. J. Comput. Syst. Sci. 59, 3, 504-520.