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

메뉴 건너뛰기

Theoretical Computer Science

Volumn 2, Issue 3, 1976, Pages 339-344

Computing an st-numbering

(2) Even, Shimon a Tarjan, Robert Endre b

a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY (Israel)

b STANFORD UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000519868 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(76)90086-4 Document Type: Article

Times cited : (226)

References (5)

1
- 84976669902
- Algorithm 147 efficient algorithms for graph manipulation
- (1973) Communications of the ACM , vol.16 , pp. 372-378
- Hopcroft¹ Tarjan²

2
- 0016117886
- Efficient planarity testing
- (1974) J. ACM , vol.21 , pp. 549-568
- Hopcroft¹ Tarjan²

3
- 0001450501
- An algorithm for planarity testing of graphs
- P. Rosenstiehl, July 1966, Gordon and Breach, New York
- (1967) Theory of Graphs: International Symposium , pp. 215-232
- Lempel¹ Even² Cederbaum³

4
- 85025224870
- Linear algorithms to recognize interval graphs and test for the consecutive ones properly
- (1975) Proc. Seventh Annual ACM Symp. on Theory of Computing , pp. 255-265
- Lueker¹ Booth²

5
- 0001790593
- Depth-first search and linear graph algorithms
- (1972) SIAM Journal on Computing , vol.1 , pp. 146-160
- Tarjan¹

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