메뉴 건너뛰기




Volumn 1, Issue , 2002, Pages 402-406

Graph partitioning using genetic algorithms with ODPX

Author keywords

Approximation algorithms; Genetic Algorithm; Graph Partition

Indexed keywords

APPROXIMATION ALGORITHMS;

EID: 84901472868     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2002.1006268     Document Type: Conference Paper
Times cited : (14)

References (9)
  • 1
    • 0030577307 scopus 로고    scopus 로고
    • Approximating the maximally balanced connected partition problem in graphs
    • J. Chlebikova. Approximating the Maximally Balanced Connected Partition Problem in graphs. Information Processing Letters, 60:225-230, 1996.
    • (1996) Information Processing Letters , vol.60 , pp. 225-230
    • Chlebikova, J.1
  • 5
    • 0009007122 scopus 로고    scopus 로고
    • Multilevel algorithms for multi-constraint graph partitioning
    • G. Karypis and V. Kumar. Multilevel Algorithms for Multi-Constraint Graph Partitioning. In Proceedings of Supercomputing, 1998.
    • (1998) Proceedings of Supercomputing
    • Karypis, G.1    Kumar, V.2
  • 6
    • 84878661011 scopus 로고    scopus 로고
    • A fast and high quality multilevel scheme for partitioning irregular graphs
    • G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing, pages 269-278, 1996.
    • (1996) SIAM Journal on Scientific Computing , pp. 269-278
    • Karypis, G.1    Kumar, V.2
  • 8
    • 84990479742 scopus 로고
    • An efficient heuristic procedure for partitioning graphs
    • B.W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49:291-307, 1970.
    • (1970) The Bell System Technical Journal , vol.49 , pp. 291-307
    • Kernighan, B.W.1    Lin, S.2


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