An On-Line Edge-Deletion Problem

Journal of the ACM (JACM)

Volumn 28, Issue 1, 1981, Pages 1-4

  Even, Shimon ^a,c   Shiloach, Yossi ^b,d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b STANFORD UNIVERSITY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^d IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976826635     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322234.322235     Document Type: Article

References (4)

1. Aho, A.V., Hopcroft, J.E., and Ullman, J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass., 1974.
2. Cheston, G.A. Incremental algorithms in graph theory. Ph.D. Diss., Dep. of Computer Science, Univ. of Toronto, March 1976 (Tech. Rep. No. 91).
3. Karp, R.M. Private communication.
4. Tarjan, R.E. Efficiency of a good but not linear set union algorithm. J. ACM 22, 2 (April 1975), 215-225.