메뉴 건너뛰기




Volumn , Issue , 2005, Pages 155-158

A fast algorithm for point labeling problem

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS;

EID: 54949094065     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (4)

References (14)
  • 5
    • 0001009871 scopus 로고
    • An n 5 2 algorithm for maximum matching in bipartite graphs
    • J. E. Hopcroft and R. E. Karp, An n 5 2 algorithm for maximum matching in bipartite graphs, SIAM J. Com-puting, vol. 2, pp. 225-231, 1973.
    • (1973) SIAM J. Com-puting , vol.2 , pp. 225-231
    • Hopcroft, J.E.1    Karp, R.E.2
  • 6
    • 84900523880 scopus 로고
    • Positioning names on maps
    • E. Imhof, Positioning names on maps, The American Cartographer, vol. 2, no. 2, pp. 128-144, 1975.
    • (1975) The American Cartographer , vol.2 , Issue.2 , pp. 128-144
    • Imhof, E.1
  • 8
    • 0009630576 scopus 로고
    • Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
    • T. Kashiwabara, S. Masuda, K. Nakajima and T. Fujisawa, Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph, Journal of Algorithms, vol. 13, pp. 161-174, 1992.
    • (1992) Journal of Algorithms , vol.13 , pp. 161-174
    • Kashiwabara, T.1    Masuda, S.2    Nakajima, K.3    Fujisawa, T.4
  • 14
    • 0141981892 scopus 로고    scopus 로고
    • Three rules suffice for good label placement
    • F. Wagner, A. Wolff, V. Kapoor and T. Strijk, Three rules suffice for good label placement, Algorithmica, vol. 30, pp. 334-349, 2001.
    • (2001) Algorithmica , vol.30 , pp. 334-349
    • Wagner, F.1    Wolff, A.2    Kapoor, V.3    Strijk, T.4


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