STOC 2020

Session 2A - New Algorithms and Hardness for Incremental SSSP in Directed Graphs

Sep 19, 2020

|

23 views

Association for Computing Machinery (ACM)

Details

Full title: New Algorithms and Hardness for Incremental Single-Source Shortest Paths in Directed Graphs

Category: STOC 2020

Comments

loading...

Reactions (0) | Note

📝 No reactions yet

Be the first one to share your thoughts!

Reactions(0)

Note

loading...

Recommended

ICAPS 2014: Stefan Edelkamp on "Symbolic and Explicit Search Hybrid through Perfect Hash Functions"

ICAPS | Aug 7, 2014

ICAPS 2012: Invited Talk by Anthony Cohn

ICAPS | Aug 15, 2014

ICAPS 2012: Invited talk by George Pappas

ICAPS | Aug 18, 2014

ICAPS 2012: Opening Remark & Invited Talk by Robert Ambrose

ICAPS | Aug 18, 2014

ICAPS 2012: Session Ia on "Temporal Planning & Scheduling"

ICAPS | Aug 18, 2014