메뉴 건너뛰기




Volumn 3692 LNBI, Issue , 2005, Pages 65-76

A lookahead branch-and-bound algorithm for the maximum quartet consistency problem

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER SCIENCE; DATA PROCESSING; PROBLEM SOLVING; TIME DOMAIN ANALYSIS;

EID: 33646180219     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11557067_6     Document Type: Conference Paper
Times cited : (8)

References (17)
  • 16
    • 18744370342 scopus 로고    scopus 로고
    • Department of Computing Science, University of Alberta, January
    • G. Wu, J. You, and G.-H. Lin. Technical Report TR05-05, Department of Computing Science, University of Alberta, January 2005.
    • (2005) Technical Report , vol.TR05-05
    • Wu, G.1    You, J.2    Lin, G.-H.3
  • 17
    • 18744370342 scopus 로고    scopus 로고
    • Department of Computing Science, University of Alberta, January
    • X. Wu, X. Wan, G. Wu, D. Xu, and G.-H. Lin. Technical Report TR05-06, Department of Computing Science, University of Alberta, January 2005.
    • (2005) Technical Report , vol.TR05-06
    • Wu, X.1    Wan, X.2    Wu, G.3    Xu, D.4    Lin, G.-H.5


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