SCOPUS 정보 검색 플랫폼

Volumn 81, Issue 6, 2002, Pages 289-296

Algorithms for transitive closure

Author keywords

Algorithms; Computational complexity; Graph algorithms; Transitive closure

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; SET THEORY;

GRAPH ALGORITHMS; TRANSITIVE CLOSURES;

GRAPH THEORY;

EID: 0037204518 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/S0020-0190(01)00245-9 Document Type: Article

Times cited : (5)

References (8)

2
- 0015205185
- Boolean matrix multiplication and transitive closure
- (1971) Proc. of 12th Annual Symp. on Switching and Automata Theory , pp. 129-131
- Fischer, M.J.¹ Meyer, A.R.²

3
- 84963745538
- A reduct and closure algorithm for graphs
- Proc. Math. Found. of Comp. Sci. 1979, Springer, Berlin
- (1979) Lecture Notes in Comput. Sci. , vol.74 , pp. 301-307
- Goralčíková, A.¹ Koubek, V.²

4
- 0007805555
- Data structures and algorithms II: Graph algorithms and NP-completeness
- Springer, Berlin
- (1984) EATCS Monographs in Comput. Sci. , vol.2
- Mehlhorn, K.¹

5
- 0007853936
- An algorithm for transitive closure with linear expected time
- (1978) SIAM J. Comput. , vol.7 , pp. 124-133
- Schnorr, C.P.¹

6
- 0024019807
- An improved algorithm for transitive closure on acyclic digraphs
- (1988) Theoret. Comput. Sci. , vol.58 , pp. 325-346
- Simon, K.¹

7
- 36349020723
- On the distribution of the transitive closure in a random acyclic digraph
- Algorithms - ESA'93 (Bad Honnef), Springer, Berlin
- (1993) Lecture Notes in Comput. Sci. , vol.726 , pp. 345-356
- Simon, K.¹ Crippa, D.² Collenberg, F.³

8
- 0001790593
- Depth first search and linear graph algorithms
- (1972) SIAM J. Comput. , vol.1 , pp. 146-160
- Tarjan, R.E.¹

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