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

메뉴 건너뛰기

Acta Informatica

Volumn 15, Issue 2, 1981, Pages 141-145

A fast algorithm for Steiner trees

(3) Kou, L a Markowsky, G a Berman, L a

a IBM T J WATSON RESEARCH CENTER (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34250246836 PISSN: 00015903 EISSN: 14320525 Source Type: Journal
DOI: 10.1007/BF00288961 Document Type: Article

Times cited : (885)

References (9)

1
- 0002136225
- Steiner minimal tree
- (1968) SIAM Journal on Applied Mathematics , vol.16 , pp. 1-29
- Gilbert, E.N.¹ Pollak, H.O.²

2
- 84933334949
- Garey, M.¹

3
- 34147120474
- A note on two problems in connection with graphs
- (1959) Numer. Math. , vol.1 , pp. 269-271
- Dijkstra, E.N.¹

4
- 84945709831
- Algorithm 97: shortest path
- (1962) Communications of the ACM , vol.5 , pp. 345
- Floyd, R.W.¹

5
- 0346781061
- All shortest distances in a graph: an improvement to Dantzig's inductive algorithm
- (1973) Discrete Math. , vol.4 , pp. 83-87
- Tabourier, Y.¹

6
- 0002260157
- An O(¦E¦ loglog¦V¦) algorithm for finding minimal spanning tree
- (1975) Information Processing Lett. , vol.4 , pp. 21-23
- Yao, A.C.C.¹

7
- 0000428085
- Finding minimal spanning tree
- (1976) SIAM Journal on Computing , vol.5 , pp. 724-742
- Cheriton, D.¹ Tarjan, R.E.²

8
- 0003037529
- Reducibility among combinatorial problems
- R.E., Miller, J.W., Thatcher, Plenum Press, New York
- (1972) Complexity of computer computations , pp. 85-104
- Karp, R.M.¹

9
- 0016891335
- On Steiner minimal trees with rectilinear distance
- (1976) SIAM J. Appl. Math. , vol.30 , pp. 104-114
- Hwang, F.K.¹

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