메뉴 건너뛰기
Bell System Technical Journal
Volumn 49, Issue 2, 1970, Pages 291-307
An Efficient Heuristic Procedure for Partitioning Graphs

(2)  Kernighan, B W a   Lin, S a  

a NONE
Author keywords

[No Author keywords available]
Indexed keywords

EID: 84990479742     PISSN: 00058580     EISSN: 15387305     Source Type: Journal    
DOI: 10.1002/j.1538-7305.1970.tb01770.x     Document Type: Article
Times cited : (3769)
References (4)
  • 2
    • 84908780328 scopus 로고
    • “Computer Solutions of the Traveling Salesman Problem,”
    • (1965) B.S.T.J. , vol.44 , Issue.10 , pp. 2245-2269
    • Lin, S.1
  • 3
    • 84990418787 scopus 로고
    • “Some Graph Partitioning Problems Related to Program Segmentation,” Ph.D. Thesis, Princeton University
    • (1969) , pp. 74-126
    • Kernighan, B.W.1
  • 4
    • 0041654220 scopus 로고
    • “Multi‐Dimensional Scaling by Optimizing Goodness of Fit to a Non‐Metric Hypothesis,”
    • and No. 2 (June 1964), pp. 115–129
    • (1964) Psychometrika , vol.29 , Issue.1 , pp. 1-27
    • Kruskal, J.B.1

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