SCOPUS 정보 검색 플랫폼

Volumn 203, Issue 1, 1998, Pages 123-141

Efficient Union-Find for planar graphs and other sparse graph classes

Author keywords

Graph algorithms; Image Segmentation; Planar graphs; Union find

Indexed keywords

EID: 0348098752 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(97)00291-0 Document Type: Article

Times cited : (18)

References (13)

1
- 85013545712
- A complement to Tarjan's result about the lower bound on the complexity of the set union problem
- L. Banachowski, A complement to Tarjan's result about the lower bound on the complexity of the set union problem, Inform. Process. Lett. 11 (2) (1980) 59-65.
- (1980) Inform. Process. Lett. , vol.11 , Issue.2 , pp. 59-65
- Banachowski, L.¹

2
- 85037918238
- A tourist guide through treewidth
- H.L. Bodlaender, A tourist guide through treewidth, Acta Cybernet. 11 (1993) 1-23.
- (1993) Acta Cybernet. , vol.11 , pp. 1-23
- Bodlaender, H.L.¹

3
- 0001294529
- A linear time algorithm for finding tree-decompositions of small treewidth
- H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996) 1305-1317.
- (1996) SIAM J. Comput. , vol.25 , pp. 1305-1317
- Bodlaender, H.L.¹

5
- 0030569893
- Two linear time Union-Find strategies for image processing
- C. Fiorio, J. Gustedt, Two linear time Union-Find strategies for image processing, Theoret. Comput. Sci. 154 (2) (1996) 165-181.
- (1996) Theoret. Comput. Sci. , vol.154 , Issue.2 , pp. 165-181
- Fiorio, C.¹ Gustedt, J.²

6
- 0020732246
- A linear-time algorithm for a special case of disjoint set union
- H.N. Gabow, R.E. Tarjan, A linear-time algorithm for a special case of disjoint set union, J. Comput. System Sci. 30 (1984) 209-221.
- (1984) J. Comput. System Sci. , vol.30 , pp. 209-221
- Gabow, H.N.¹ Tarjan, R.E.²

7
- 0004302191
- Morgan-Kaufmann, Los Altos, CA
- J.L. Hennessy, D.A. Patterson, Computer Architecture, A Quantitative Approach, 2nd ed., Morgan-Kaufmann, Los Altos, CA, 1996.
- (1996) Computer Architecture, a Quantitative Approach, 2nd Ed.
- Hennessy, J.L.¹ Patterson, D.A.²

8
- 0030082304
- Lower bounds for the Union-Find and the Split-Find problem on pointer machines
- J.A. La Poutré, Lower bounds for the Union-Find and the Split-Find problem on pointer machines, J. Comput. System Sci. 52 (1) (1996) 87-99.
- (1996) J. Comput. System Sci. , vol.52 , Issue.1 , pp. 87-99
- La Poutré, J.A.¹

9
- 0018457301
- A separator theorem for planar graphs
- R.J. Lipton, R. E. Tarjan, A separator theorem for planar graphs, SIAM J. Appl. Math. 36 (1979) 177-189.
- (1979) SIAM J. Appl. Math. , vol.36 , pp. 177-189
- Lipton, R.J.¹ Tarjan, R.E.²

10
- 0004047313
- Springer, Berlin
- K. Melhorn, Data Structures and Algorithms, vol 1: Sorting and Searching, Springer, Berlin, 1984.
- (1984) Data Structures and Algorithms, Vol 1: Sorting and Searching , vol.1
- Melhorn, K.¹

11
- 0008519763
- J. van Leeuwen (Ed.), ch. 6, Data Structures, Elsevier, Amsterdam
- K. Mehlhorn, A. Tsakalidis, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. A, Algorithms and Complexity, ch. 6, Data Structures, Elsevier, Amsterdam, 1990, pp. 301-314.
- (1990) Handbook of Theoretical Computer Science, Vol. A, Algorithms and Complexity , vol.A , pp. 301-314
- Mehlhorn, K.¹ Tsakalidis, A.²

12
- 0016495233
- Efficiency of a good but not linear set union algorithm
- R.E. Tarjan, Efficiency of a good but not linear set union algorithm, J. Assoc. Comput. Mach. 22 (1975) 215-225.
- (1975) J. Assoc. Comput. Mach. , vol.22 , pp. 215-225
- Tarjan, R.E.¹

13
- 0018455018
- A class of algorithms which require non-linear time to maintain disjoint sets
- R.E. Tarjan, A class of algorithms which require non-linear time to maintain disjoint sets, J. Comput. System Sci. 18 (1979) 110-127.
- (1979) J. Comput. System Sci. , vol.18 , pp. 110-127
- Tarjan, R.E.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.