Fully dynamic output bounded single source shortest path problem

被引：0
|
作者：
Frigioni, D [1 ]
MarchettiSpaccamela, A [1 ]
Nanni, U [1 ]
机构：
[1] UNIV LAQUILA,DIPARTIMENTO MATEMAT PURA & APPLICATA,I-67010 COPPITO AQUILA,ITALY
来源：
PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS | 1996年
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
引用
收藏
页码：212 / 221
页数：10
相关论文
共 50 条
  • [21] A novel single source shortest path algorithm
    Rani, R. Uma
    [J]. JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2009, 12 (06): : 671 - 680
  • [22] A simple parallel algorithm for the single-source shortest path problem on planar digraphs
    Träff, JL
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2000, 60 (09) : 1103 - 1124
  • [23] DSMR: A Shared and Distributed Memory Algorithm for Single-Source Shortest Path Problem
    Maleki, Saeed
    Nguyen, Donald
    Lenharth, Andrew
    Garzaran, Maria
    Padua, David
    Pingali, Keshav
    [J]. ACM SIGPLAN NOTICES, 2016, 51 (08) : 381 - 382
  • [24] SPLZ: An efficient algorithm for single source shortest path problem using compression method
    Sun, Jingwei
    Sun, Guangzhong
    [J]. GEOINFORMATICA, 2016, 20 (01) : 1 - 18
  • [25] A faster algorithm for the single source shortest path problem with few distinct positive lengths
    Orlin, James B.
    Madduri, Kamesh
    Subramani, K.
    Williamson, M.
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (02) : 189 - 198
  • [26] GRASP Extending Graph Separators for the Single-Source Shortest-Path Problem
    Efentakis, Alexandros
    Pfoser, Dieter
    [J]. ALGORITHMS - ESA 2014, 2014, 8737 : 358 - 370
  • [27] SPLZ: An efficient algorithm for single source shortest path problem using compression method
    Jingwei Sun
    Guangzhong Sun
    [J]. GeoInformatica, 2016, 20 : 1 - 18
  • [28] A tight analysis of the (1+1)-EA for the single source shortest path problem
    Doerr, Benjamin
    Happ, Edda
    Klein, Christian
    [J]. 2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS, 2007, : 1890 - 1895
  • [29] Tight Analysis of the (1+1)-EA for the Single Source Shortest Path Problem
    Doerr, Benjamin
    Happ, Edda
    Klein, Christian
    [J]. EVOLUTIONARY COMPUTATION, 2011, 19 (04) : 673 - 691
  • [30] Practical efficiency of the linear-time algorithm for the single source shortest path problem
    Asano, Y
    Imai, H
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 2000, 43 (04) : 431 - 447
12345