메뉴 건너뛰기




Volumn 4212 LNAI, Issue , 2006, Pages 679-686

B-matching for spectral clustering

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; EDGE DETECTION; GRAPH THEORY; INTEGER PROGRAMMING; POLYNOMIALS;

EID: 33750286553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11871842_67     Document Type: Conference Paper
Times cited : (26)

References (10)
  • 3
    • 0032608479 scopus 로고    scopus 로고
    • Balanced network flows. I. A unifying framework for design and analysis of matching algorithms
    • Fremuth-Paeger, C., Jungnickel, D.: Balanced network flows. I. A unifying framework for design and analysis of matching algorithms. Networks 33 1 (1999) 1-28
    • (1999) Networks , vol.33 , Issue.1 , pp. 1-28
    • Fremuth-Paeger, C.1    Jungnickel, D.2
  • 5
    • 85017260996 scopus 로고    scopus 로고
    • Implementing weighted b-matching algorithms: Insights from a computational study
    • Muller-Hannemann, M., Schwartz, A.: Implementing weighted b-matching algorithms: insights from a computational study. J. Exp. Algorithmics 5 (2000) 1084-6654
    • (2000) J. Exp. Algorithmics , vol.5 , pp. 1084-6654
    • Muller-Hannemann, M.1    Schwartz, A.2
  • 8
    • 0034704222 scopus 로고    scopus 로고
    • Nonlinear dimensionality reduction by locally linear embedding
    • Roweis, S., Saul, L.: Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science, 290 5500 (2000)
    • (2000) Science , vol.290 , Issue.5500
    • Roweis, S.1    Saul, L.2
  • 10
    • 0003500836 scopus 로고
    • A short proof of the factor theorem for finite graphs
    • Tutte, W.T.: A short proof of the factor theorem for finite graphs. Canadian Journal of Mathematics 6 (1954) 347-352
    • (1954) Canadian Journal of Mathematics , vol.6 , pp. 347-352
    • Tutte, W.T.1


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