메뉴 건너뛰기




Volumn 5383 LNCS, Issue , 2008, Pages 191-212

Time-aggregated graphs for modeling spatio-temporal networks

Author keywords

Location based services; Shortest paths; Spatio temporal data bases; Time aggregated graphs

Indexed keywords

ALGORITHMS; INFORMATION THEORY; MOTOR TRANSPORTATION; PROGRAMMING THEORY; ROADS AND STREETS; SYSTEMS ENGINEERING; TRAFFIC CONTROL; WIRELESS SENSOR NETWORKS;

EID: 58849146182     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92148-6_7     Document Type: Conference Paper
Times cited : (51)

References (25)
  • 3
    • 4043140750 scopus 로고    scopus 로고
    • Algorithms for minimum-cost paths in time-dependent networks
    • Dean, B.C.: Algorithms for minimum-cost paths in time-dependent networks. Networks 44(1), 41-46 (2004)
    • (2004) Networks , vol.44 , Issue.1 , pp. 41-46
    • Dean, B.C.1
  • 7
    • 58849086926 scopus 로고    scopus 로고
    • ESRI. ArcGIS Network Analyst (2006), littp: //www. esri. com/software/arcgis/extensions/
    • ESRI. ArcGIS Network Analyst (2006), littp: //www. esri. com/software/arcgis/extensions/
  • 8
    • 58849150558 scopus 로고    scopus 로고
    • George, B., Shekhar, S.: Time-aggregated Graphs for Modeling Spatio-Temporal Networks - An Extended Abstract. In: Proceedings of Workshops at International Conference on Conceptual Modeling (November 2006)
    • George, B., Shekhar, S.: Time-aggregated Graphs for Modeling Spatio-Temporal Networks - An Extended Abstract. In: Proceedings of Workshops at International Conference on Conceptual Modeling (November 2006)
  • 9
    • 0004064875 scopus 로고    scopus 로고
    • Hall, R.W, ed, Kluwer Academic Publishers, Dordrecht
    • Hall, R.W. (ed.): Handbook of Transportation Science. Kluwer Academic Publishers, Dordrecht (2003)
    • (2003) Handbook of Transportation Science
  • 11
    • 0002607217 scopus 로고
    • Fastest paths in time-dependent networks for intelligent vehicle highway systems applications
    • Kaufman, D.E., Smith, R.L.: Fastest paths in time-dependent networks for intelligent vehicle highway systems applications. IVHS Journal 1(1), 1-11 (1993)
    • (1993) IVHS Journal , vol.1 , Issue.1 , pp. 1-11
    • Kaufman, D.E.1    Smith, R.L.2
  • 13
    • 21644488876 scopus 로고    scopus 로고
    • Spatio-Temporal Databases
    • Koubarakis, M, Sellis, T.K, Frank, A.U, Grumbach, S, Güg, R.H, Jensen,C.S, Lorentzos, N.A, Manolopoulos, Y, Nardelli, E, Pernici, B, Schek, H.-J, Scholl, M, Theodoulidis, B, Tryfona, N.eds, Springer, Heidelberg
    • Koubarakis, M., Sellis, T.K., Frank, A.U., Grumbach, S., Güg, R.H., Jensen,C.S., Lorentzos, N.A., Manolopoulos, Y., Nardelli, E., Pernici, B., Schek, H.-J., Scholl, M., Theodoulidis, B., Tryfona, N.(eds.): Spatio-Temporal Databases. LNCS, vol. 2520. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2520
  • 14
    • 26444598445 scopus 로고    scopus 로고
    • Lu, Q., George, B., Shekhar, S.: Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results, In: Bauzer Medeiros, C, Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, 3633. Springer, Heidelberg (2005)
    • Lu, Q., George, B., Shekhar, S.: Capacity Constrained Routing Algorithms for Evacuation Planning: A Summary of Results, In: Bauzer Medeiros, C, Egenhofer, M.J., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633. Springer, Heidelberg (2005)
  • 16
    • 84987034656 scopus 로고
    • Minimum weight paths in time-dependent networks
    • Orda, A., Rom, R.: Minimum weight paths in time-dependent networks. Networks 21, 295-319 (1991)
    • (1991) Networks , vol.21 , pp. 295-319
    • Orda, A.1    Rom, R.2
  • 17
    • 0002488332 scopus 로고    scopus 로고
    • Shortest path algorithms in tranportation models: Classical and innovative aspects
    • Kluwer, pp
    • Pallottino, S., Scuttella, M.G.: Shortest path algorithms in tranportation models: Classical and innovative aspects. In: Equilibrium and Advanced transportation Modelling (Kluwer), pp. 245-281 (1998)
    • (1998) Equilibrium and Advanced transportation Modelling , pp. 245-281
    • Pallottino, S.1    Scuttella, M.G.2
  • 20
    • 33845199934 scopus 로고    scopus 로고
    • Implicit Maximization of Flows over Time
    • Technical report, University of Dortmund
    • Sawitzki, D.: Implicit Maximization of Flows over Time. Technical report, University of Dortmund (2004)
    • (2004)
    • Sawitzki, D.1
  • 21
    • 0000418612 scopus 로고
    • An appraisal of some shortest path algorithms
    • Dreyfus, S.E.: An appraisal of some shortest path algorithms. Operations Research 17, 395-412 (1969)
    • (1969) Operations Research , vol.17 , pp. 395-412
    • Dreyfus, S.E.1
  • 23
    • 0030734554 scopus 로고    scopus 로고
    • Shekhar, S., Liu, D.: CCAM: A Connectivity-Clustered Access Method for Networks and Networks Computations. IEEE Transactions on Knowledge and Data Engineering, 9 (January 1997)
    • Shekhar, S., Liu, D.: CCAM: A Connectivity-Clustered Access Method for Networks and Networks Computations. IEEE Transactions on Knowledge and Data Engineering, vol. 9 (January 1997)
  • 24
    • 33646832333 scopus 로고    scopus 로고
    • Graph data representation in oracle datahese 10g: Case studies in life sciences
    • Stephens, S., Rung, J., Lopez, X.: Graph data representation in oracle datahese 10g: Case studies in life sciences. IEEE Data Engineering Bulletin 27(4), 61-66 (2004)
    • (2004) IEEE Data Engineering Bulletin , vol.27 , Issue.4 , pp. 61-66
    • Stephens, S.1    Rung, J.2    Lopez, X.3


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