Negative-Weight Single-Source Shortest Paths in Near-linear Time

被引：0
|
作者：
Bernstein, Aaron [1 ]
Nanongkai, Danupon [2 ]
Wulff-Nilsen, Christian [3 ]
机构：
[1] Rutgers University, Department of Computer Science, New Brunswick,NJ, United States
[2] University of Copenhagen, Kth, Mpi for Informatics, Denmark
[3] Barc, University of Copenhagen, Department of Computer Science, Copenhagen, Denmark
来源：
Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS | 2022年 / 2022-October卷
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Directed graphs
引用
收藏
页码：600 / 611
相关论文
共 50 条
  • [1] Negative-Weight Single-Source Shortest Paths in Near-Linear Time
    Bernstein, Aaron
    Nanongkai, Danupon
    Wulff-Nilsen, Christian
    COMMUNICATIONS OF THE ACM, 2025, 68 (02) : 87 - 94
  • [2] Negative-Weight Single-Source Shortest Paths in Near-linear Time
    Bernstein, Aaron
    Nanongkai, Danupon
    Wulff-Nilsen, Christian
    arXiv, 2022,
  • [3] Negative-Weight Single-Source Shortest Paths in Near-linear Time
    Bernstein, Aaron
    Nanongkai, Danupon
    Wulff-Nilsen, Christian
    2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 600 - 611
  • [4] Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster!
    Bringmann, Karl
    Cassis, Alejandro
    Fischer, Nick
    2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS, 2023, : 515 - 538
  • [5] Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
    Henzinger, Monika
    Krinninger, Sebastian
    Nanongkai, Danupon
    JOURNAL OF THE ACM, 2018, 65 (06)
  • [6] Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
    Henzinger, Monika
    Krinninger, Sebastian
    Nanongkai, Danupon
    2014 55TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2014), 2014, : 146 - 155
  • [7] Simpler computation of single-source shortest paths in linear average time
    Hagerup, T
    STACS 2004, PROCEEDINGS, 2004, 2996 : 362 - 369
  • [8] Simpler computation of single-source shortest paths in linear average time
    Hagerup, T
    THEORY OF COMPUTING SYSTEMS, 2006, 39 (01) : 113 - 120
  • [9] Simpler Computation of Single-Source Shortest Paths in Linear Average Time
    Torben Hagerup
    Theory of Computing Systems, 2006, 39 : 113 - 120
  • [10] Undirected single-source shortest paths with positive integer weights in linear time
    Thorup, M
    JOURNAL OF THE ACM, 1999, 46 (03) : 362 - 394
12345