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

메뉴 건너뛰기

Discrete Mathematics

Volumn 86, Issue 1-3, 1990, Pages 165-177

Unit disk graphs

(3) Clark, Brent N a Colbourn, Charles J a Johnson, David S b

a UNIVERSITY OF WATERLOO (Canada)

b LUCENT TECHNOLOGIES (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000839639 PISSN: 0012365X EISSN: None Source Type: Journal
DOI: 10.1016/0012-365X(90)90358-O Document Type: Article

Times cited : (1149)

References (20)

1
- 80053032641
- Unit disk graphs
- University of Waterloo
- (1985) M. Math. Thesis
- Clark¹

2
- 0015330635
- Theoretical improvements in algorithmic efficiency for network flow problems
- (1972) J. ACM , vol.19 , pp. 248-264
- Edmonds¹ Karp²

3
- 30244473678
- Some simplified NP-complete graph problems
- (1976) Theoret. Comput. Sci. , vol.1 , pp. 237-267
- Garey¹ Johnson² Stockmeyer³

4
- 0000727336
- The rectilinear Steiner tree problem is NP-complete
- (1977) SIAM Journal on Applied Mathematics , vol.32 , pp. 826-834
- Garey¹ Johnson²

5
- 0003603813
- Freeman, New York
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey¹ Johnson²

6
- 0003947606
- Academic Press, New York
- (1980) Algorithmic Graph Theory and Perfect Graphs
- Golumbic¹

7
- 0019213982
- Frequency assignment: Theory and applications
- (1980) Proc IEEE , vol.68 , pp. 1497-1514
- Hale¹

8
- 0000412320
- Hamilton paths in grid graphs
- (1982) SIAM Journal on Computing , vol.11 , pp. 676-686
- Itai¹ Papadimitriou² Szwarcfiter³

9
- 49049144709
- The NP-completeness column: An ongoing guide
- (1982) J. Algorithms , vol.3 , pp. 182-195
- Johnson¹

10
- 0004706810
- The NP-completeness column: An ongoing guide
- (1985) J. Algorithms , vol.6 , pp. 434-451
- Johnson¹

11
- 45749154844
- The NP-completeness column: An ongoing guide
- (1987) J. Algorithms , vol.8 , pp. 438-448
- Johnson¹

12
- 0021466282
- C 900 — An advanced mobile radio telephone system with optimum frequency utilization
- (1984) IEEE Trans. Selected Areas in Communication , vol.2 , pp. 589-597
- Kammerlander¹

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

14
- 84914298650
- J. Kilian, personal communication.

15
- 0002794707
- Planar formulae and their uses
- (1982) SIAM Journal on Computing , vol.11 , pp. 329-343
- Lichtenstein¹

16
- 0019530025
- The computational complexity of the M-center problems in the plane
- (1981) Trans. IECE Japan , vol.64 E , pp. 57-64
- Masuyama¹ Ibaraki² Hasegawa³

17
- 0002837059
- Algorithmic aspects of comparability graphs and interval graphs
- I. Rival, Reidel, Dordrecht
- (1985) Graphs and Order , pp. 41-101
- Mohring¹

18
- 0001599923
- The location of emergency service facilities
- (1971) Operations Research , vol.19 , pp. 1363-1373
- Toregas¹ Swain² Revelle³ Bergeman⁴

19
- 0019532794
- Universality considerations in VLSI circuits
- (1981) IEEE Transactions on Computers , vol.30 , pp. 135-140
- Valiant¹

20
- 0021468244
- Outage probability in mobile telephony with directive antennas and macrodiversity
- (1984) IEEE Trans. Selected Areas in Communication , vol.2 , pp. 507-511
- Yeh¹ Wilson² Schwartz³

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