메뉴 건너뛰기




Volumn , Issue , 2004, Pages 455-464

Spectral partitioning, eigenvalue bounds, and circle packings for graphs of bounded genus

Author keywords

Algorithms; Theory

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; EIGENVALUES AND EIGENFUNCTIONS; HEURISTIC METHODS; MATRIX ALGEBRA; THEOREM PROVING;

EID: 4544358283     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007352.1007357     Document Type: Conference Paper
Times cited : (4)

References (24)
  • 2
    • 0029354779 scopus 로고
    • Recent directions in netlist partitioning: A survey
    • ALPERT, C. J., AND KAHNG, A. B. Recent directions in netlist partitioning: a survey. Integration: the VLSI Journal 19 (1995), 1-81.
    • (1995) Integration: The VLSI Journal , vol.19 , pp. 1-81
    • Alpert, C.J.1    Kahng, A.B.2
  • 6
    • 4544274553 scopus 로고
    • A framework for the analysis and construction of domain decomposition preconditioners
    • UCLA
    • CHAN, T., AND RESASCO, D. C. A framework for the analysis and construction of domain decomposition preconditioners. Tech. rep., UCLA, 1987.
    • (1987) Tech. Rep.
    • Chan, T.1    Resasco, D.C.2
  • 7
    • 0005900276 scopus 로고
    • Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes
    • CHAN, T., AND SMITH, B. Domain decomposition and multigrid algorithms for elliptic problems on unstructured meshes. Contemporary Mathematics (1993), 1-14.
    • (1993) Contemporary Mathematics , pp. 1-14
    • Chan, T.1    Smith, B.2
  • 12
  • 14
    • 0026925324 scopus 로고
    • New spectral methods for ratio cut partitioning and clustering
    • September
    • HAGEN, L., AND KAHNG, A. B. New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on computer-aided design 11, 9 (September 1992), 1074-1085.
    • (1992) IEEE Transactions on Computer-aided Design , vol.11 , Issue.9 , pp. 1074-1085
    • Hagen, L.1    Kahng, A.B.2
  • 15
    • 0000742744 scopus 로고
    • Fixed points, Koebe uniformization and circle packings
    • HE, Z.-X., AND SCHRAMM, O. Fixed points, Koebe uniformization and circle packings. Annals of Mathematics 137 (1993), 369-406.
    • (1993) Annals of Mathematics , vol.137 , pp. 369-406
    • He, Z.-X.1    Schramm, O.2
  • 17
    • 22444454208 scopus 로고    scopus 로고
    • A recurrence/transience result for circle packings
    • December
    • MCCAUGHAN, G. A recurrence/transience result for circle packings. Proceedings of the American Mathematical Society 126, 12 (December 1998), 3647-3656.
    • (1998) Proceedings of the American Mathematical Society , vol.126 , Issue.12 , pp. 3647-3656
    • Mccaughan, G.1
  • 19
    • 84972500328 scopus 로고
    • The convergence of circle packings to the Riemann mapping
    • RODIN, B., AND SULLIVAN, D. The convergence of circle packings to the Riemann mapping. J. Differential Geometry 26 (1987), 349-360.
    • (1987) J. Differential Geometry , vol.26 , pp. 349-360
    • Rodin, B.1    Sullivan, D.2
  • 20
    • 44949282112 scopus 로고
    • Partitioning of unstructured problems for parallel processing
    • SIMON, H. Partitioning of unstructured problems for parallel processing, computer systems in engineering 2(2/3) (1991), 135-148.
    • (1991) Computer Systems in Engineering , vol.2 , Issue.2-3 , pp. 135-148
    • Simon, H.1
  • 23
    • 38249026284 scopus 로고
    • The graph genus problem is np-complete
    • December
    • THOMASSEN, C. The graph genus problem is np-complete. Journal of Algorithms 10, 4 (December 1989), 568-576.
    • (1989) Journal of Algorithms , vol.10 , Issue.4 , pp. 568-576
    • Thomassen, C.1
  • 24
    • 0003516752 scopus 로고
    • Performance of dynamic load balancing algorithms for unstructured mesh calculations
    • California Institute of Technology
    • WILLIAMS, R. D. Performance of dynamic load balancing algorithms for unstructured mesh calculations. Tech. rep., California Institute of Technology, 1990.
    • (1990) Tech. Rep.
    • Williams, R.D.1


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