SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Computer and System Sciences

Volumn 30, Issue 2, 1985, Pages 209-221

A linear-time algorithm for a special case of disjoint set union

(2) Gabow, Harold N a Tarjan, Robert Endre b

a UNIVERSITY OF COLORADO (United States)

b LUCENT TECHNOLOGIES (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISJOINT SET UNION; LINEAR-TIME ALGORITHM;

COMPUTER PROGRAMMING;

EID: 0020732246 PISSN: 00220000 EISSN: 10902724 Source Type: Journal
DOI: 10.1016/0022-0000(85)90014-5 Document Type: Article

Times cited : (456)

References (32)

1
- 0003415652
- Addison-Wesley, Reading, Mass
- (1974) The Design and Annalysis of Computer Algorithms
- Aho¹ Hopcroft² Ullman³

2
- 0012583137
- On finding lowest common ancestors in trees
- (1976) SIAM Journal on Computing , vol.5 , pp. 115-132
- Aho¹ Hopcroft² Ullman³

3
- 0004253669
- Prentice-Hall, Englewood Cliffs N.J
- (1976) A Discipline of Programming
- Dijkstra¹

4
- 0017019338
- Linear expected time of a simple union-find algorithm
- (1976) Inform. Process. Lett. , vol.5 , pp. 146-148
- Doyle¹ Rivest²

5
- 0020748125
- Scheduling unit-time tasks with integer release times and deadlines
- (1983) Inform. Process. Lett. , vol.16 , pp. 171-173
- Frederickson¹

6
- 0016943409
- An efficient implementation of Edmonds' algorithm for maximum matching on graphs
- (1976) J. Assoc. Comput. Mach. , vol.23 , pp. 221-234
- Gabow¹

7
- 0009914827
- A linear-time recognition algorithm for interval dags
- (1981) Inform. Process. Lett. , vol.12 , pp. 20-22
- Gabow¹

8
- 0020163787
- An almost-linear algorithm for two-processor scheduling
- (1982) J. Assoc. Comput. Mach. , vol.29 , pp. 766-780
- Gabow¹

9
- 0020921596
- A linear-time algorithm for a special case of disjoint set union
- (1983) Proc. 15th Annual ACM Sympos. on Theory of Computing , pp. 246-251
- Gabow¹ Tarjan²

10
- 85068054937
- A linear time algorithm for the least common ancestors problem
- (1980) Proc. 21st Annual Sympos. on Found. of Comput. Sci. , pp. 308-319
- Harel¹

11
- 0021426157
- Fast algorithms for finding nearest common ancestors
- (1984) SIAM J. Comput. , vol.13 , pp. 338-355
- Harel¹ Tarjan²

12
- 84915726319
- Experiments on an Asymptotically Optimum, Special Purpose Set Merging Algorithm
- Department of Computer Science, University of Colorado, Boulder, Clo
- (1983) M. S. thesis
- Havens¹

13
- 0040713319
- Set merging algorithms
- (1973) SIAM Journal on Computing , vol.2 , pp. 294-303
- Hopcroft¹ Ullman²

14
- 0004197592
- Computer Science, Potomac, Md
- (1978) Fundamentals of Computer Algorithms
- Horowitz¹ Sahni²

15
- 84915726318
- H. Imai and T. Asano, Efficient algorithms for geometric graph search problems, J. Algorithms, to appear.

16
- 0021568048
- Dynamic segment intersection search with applications
- (1984) Proc. 25th Annual IEEE Sympos. on Found. of Comput. Sci. , pp. 393-402
- Imai¹ Asano²

17
- 0000789133
- The expected linearity of a simple equivalence algorithm
- (1978) Theoret. Comput. Sci. , vol.6 , pp. 281-315
- Knuth¹ Schönhage²

18
- 84976651458
- A fast algorithm for finding dominators in a flowgraph
- (1979) ACM Transactions on Programming Languages and Systems , vol.1 , pp. 121-141
- Lengauer¹ Tarjan²

19
- 0019691164
- Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
- (1981) Acta Inform. , vol.15 , pp. 329-346
- Lipski¹ Preparata²

20
- 0021478781
- An O(n log n) Manhattan path algorithm
- (1984) Inform. Process. Lett. , vol.19 , pp. 99-102
- Lipski¹

21
- 84915726317
- S. Micali, Private communication, May 1982.

22
- 85064850083
- An O(√|V| · |E|) algorithm for finding maximum matching in general graphs
- (1980) Proc. 21st Annual IEEE Sympos. on Found. of Comput. Sci. , pp. 17-27
- Micali¹ Vazirani²

23
- 0000522561
- Scheduling interval-ordered tasks
- (1979) SIAM Journal on Computing , vol.8 , pp. 405-409
- Papadimitriou¹ Yannakakis²

24
- 0020253020
- Three layers are enough
- (1982) Proc. 23rd Annual IEEE Sympos. on Found. of Comput. Sci. , pp. 350-357
- Preparata¹ Lipski²

25
- 0003926743
- Scheduling graphs on two processors
- (1976) SIAM Journal on Computing , vol.5 , pp. 73-82
- Sethi¹

26
- 0016309945
- Testing flow graph reducibility
- (1974) Journal of Computer and System Sciences , vol.8 , pp. 355-365
- Tarjan¹

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

28
- 0016882010
- Edge-disjoint spanning trees and depth-first search
- (1976) Acta Inform. , vol.6 , pp. 171-185
- Tarjan¹

29
- 0018533367
- Applications of path compression on balanced trees
- (1979) J. Assoc. Comput. Mach. , vol.26 , Issue.4 , pp. 690-715
- Tarjan¹

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

31
- 0021415472
- Worst-case analysis of set union algorithms
- (1984) J. Assoc. Comput. Mach. , vol.31 , pp. 245-281
- Tarjan¹ Van Leeuwen²

32
- 0021975315
- A linear algorithm for finding dominators in flow graphs and related problems
- to appear
- (1985) Proc. 17th Annual ACM Sympos. on Theory of Computing
- Harel¹

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