메뉴 건너뛰기
Information Processing Letters
Volumn 85, Issue 6, 2003, Pages 301-302
A simple algorithm for edge-coloring bipartite multigraphs
Author keywords

Edge coloring; Graph algorithms
Indexed keywords

ALGORITHMS; DATA STRUCTURES; THEOREM PROVING;
EID: 0037475041     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00446-5     Document Type: Article
Times cited : (59)
References (6)
  • 1
    • 0000175577 scopus 로고
    • On edge-coloring bipartite graphs
    • Cole R., Hopcroft J. On edge-coloring bipartite graphs. SIAM J. Comput. 11:1982;540-546.
    • (1982) SIAM J. Comput. , vol.11 , pp. 540-546
    • Cole, R.1    Hopcroft, J.2
  • 2
    • 0040438506 scopus 로고    scopus 로고
    • Edge-coloring bipartite multigraphs in O(E log D) time
    • Cole R., Ost K., Schirra S. Edge-coloring bipartite multigraphs in O(ElogD) time. Combinatorica. 21:2001;5-12.
    • (2001) Combinatorica , vol.21 , pp. 5-12
    • Cole, R.1    Ost, K.2    Schirra, S.3
  • 3
    • 0001575222 scopus 로고
    • Using Euler partitions to edge color bipartite multigraphs
    • Gabow H.N. Using Euler partitions to edge color bipartite multigraphs. Internat. J. Comput. Inform. Sci. 5:1976;345-355.
    • (1976) Internat. J. Comput. Inform. Sci. , vol.5 , pp. 345-355
    • Gabow, H.N.1
  • 5
    • 0032266933 scopus 로고    scopus 로고
    • Bipartite edge-coloring in O(Δm) time
    • Schrijver A. Bipartite edge-coloring in O(Δm) time. SIAM J. Comput. 28:1999;841-846.
    • (1999) SIAM J. Comput. , vol.28 , pp. 841-846
    • Schrijver, A.1

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