메뉴 건너뛰기




Volumn 12, Issue 4, 2008, Pages 411-433

Processing optimal sequenced route queries using Voronoi diagrams

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; DECODING; INFORMATION ANALYSIS; MOTOR TRANSPORTATION; SET THEORY; TOPOLOGY;

EID: 51049095452     PISSN: 13846175     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10707-007-0034-z     Document Type: Article
Times cited : (34)

References (12)
  • 3
    • 0034288747 scopus 로고    scopus 로고
    • "The graph Voronoi diagram with applications"
    • M. Erwig. "The graph Voronoi diagram with applications," Networks, Vol. 36(3):156-163, 2000.
    • (2000) Networks , vol.36 , Issue.3 , pp. 156-163
    • Erwig, M.1
  • 6
    • 85117329200 scopus 로고    scopus 로고
    • "Voronoi-based K nearest neighbor search for spatial network databases"
    • M. Kolahdouzan and C. Shahabi. "Voronoi-based K nearest neighbor search for spatial network databases," in VLDB 2004, Toronto, Canada, 2004.
    • (2004) VLDB 2004, Toronto, Canada
    • Kolahdouzan, M.1    Shahabi, C.2
  • 10
    • 45749145450 scopus 로고    scopus 로고
    • "The optimal sequenced route query"
    • Bases SSN: 1066-8888 (Print) 0949-877X (Online), doi: 10.1007/ s00778-006-0038-6, Issue: Online First
    • M. Sharifzadeh, M. Kolahdouzan, and C. Shahabi. "The optimal sequenced route query," The VLDB Journal: The International Journal on very Large Data Bases, SSN: 1066-8888 (Print) 0949-877X (Online), doi: 10.1007/s00778-006-0038-6, Issue: Online First, 2007.
    • (2007) The VLDB Journal: The International Journal on Very Large Data
    • Sharifzadeh, V.1    Kolahdouzan, M.2    Shahabi, V.3


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