메뉴 건너뛰기




Volumn 2108, Issue , 2001, Pages 150-158

Maximum red/blue interval matching with applications

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84944031445     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_17     Document Type: Conference Paper
Times cited : (7)

References (12)
  • 1
    • 0346233617 scopus 로고    scopus 로고
    • Parallel algorithms for maximum matching in complements of interval graphs and related problems
    • M. G. Andrews, M. J. Atallah, D. Z. Chen, and D. T. Lee, “Parallel algorithms for maximum matching in complements of interval graphs and related problems,” Algorithmica, 26 (2) (2000), pp. 263–289.
    • (2000) Algorithmica , vol.26 , Issue.2 , pp. 263-289
    • Andrews, M.G.1    Atallah, M.J.2    Chen, D.Z.3    Lee, D.T.4
  • 6
    • 0001009871 scopus 로고
    • An n5/2 algorithm for maximum matchings in bipartite graphs
    • J. E. Hopcroft and R. M. Karp, “An n5/2 algorithm for maximum matchings in bipartite graphs,” SIAM J. Comput., 2 (1973), pp. 225–231.
    • (1973) SIAM J. Comput , vol.2 , pp. 225-231
    • Hopcroft, J.E.1    Karp, R.M.2
  • 7
    • 0024907951 scopus 로고
    • A parallel algorithm for maximum matching in interval graphs
    • A. Moitra and R. C. Johnson, “A parallel algorithm for maximum matching in interval graphs,” Proc. Int. Conf. Parallel Processing, 1989, Vol. III, pp. 114–120.
    • (1989) Proc. Int. Conf. Parallel Processing , vol.3 , pp. 114-120
    • Moitra, A.1    Johnson, R.C.2
  • 9
    • 0002484064 scopus 로고
    • Preserving order in a forest in less than logarithmic time and linear space
    • P. van Emde Boas, “Preserving order in a forest in less than logarithmic time and linear space,” Information Processing Letters, 6 (3) (1977), pp. 80–82.
    • (1977) Information Processing Letters , vol.6 , Issue.3 , pp. 80-82
    • Van Emde Boas, P.1
  • 10
    • 34250391491 scopus 로고
    • Design and implementation of an efficient priority queue
    • P. van Emde Boas, R. Kaas, and E. Zijlstra, “Design and implementation of an efficient priority queue,” Mathematical Systems Theory, 10 (1977), pp. 99–127.
    • (1977) Mathematical Systems Theory , vol.10 , pp. 99-127
    • Van Emde Boas, P.1    Kaas, R.2    Zijlstra, E.3
  • 12
    • 0028795770 scopus 로고
    • Optimization of leaf positioning when shaping a radiation field with a multileaf collimator
    • C. X. Yu, D. Yan, M. N. Du, S. Zhou, and L. J. Verhey, “Optimization of leaf positioning when shaping a radiation field with a multileaf collimator,” Phys. Med. Biol., 40 (2) (1995), pp. 305–308.
    • (1995) Phys. Med. Biol , vol.40 , Issue.2 , pp. 305-308
    • Yu, C.X.1    Yan, D.2    Du, M.N.3    Zhou, S.4    Verhey, L.J.5


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