Sublinear-time Decremental Algorithms for Single-source Reachability and 
Shortest Paths on Directed Graphs

Henzinger, Monika; Krinninger, Sebastian; Nanongkai, Danupon

doi:10.1145/2591796.2591869

Local TagsRelease HistoryDetailsSummary

Sublinear-time Decremental Algorithms for Single-source Reachability and Shortest Paths on Directed Graphs

Henzinger, M., Krinninger, S., & Nanongkai, D. (2014). Sublinear-time Decremental Algorithms for Single-source Reachability and Shortest Paths on Directed Graphs. In STOC '14 (pp. 674-683). New York, NY: ACM.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/21.11116/0000-000E-5BCE-5 Version Permalink: https://hdl.handle.net/21.11116/0000-000E-5BCF-4

Genre: Conference Paper

Files

show Files

Locators

show

Creators

show

hide

Creators:
Henzinger, Monika¹, Author
Krinninger, Sebastian¹, Author
Nanongkai, Danupon¹, Author

Affiliations:
1External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Date issued: 2014

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: BibTex Citekey: Henzinger_STOC14
DOI: 10.1145/2591796.2591869

Degree: -

Event

show

hide

Title: 46th Annual Symposium on Theory of Computing

Place of Event: New York, NY, USA

Start-/End Date: 2014-05-31 - 2014-07-03

Legal Case

show

Project information

show

Source 1

show

hide

Title: STOC '14

Abbreviation : STOC 2014

Subtitle : Proceedings of the 2014 ACM Symposium on Theory of Computing

Source Genre: Proceedings

Creator(s):

Affiliations:

Publ. Info: New York, NY : ACM

Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 674 - 683 Identifier: ISBN: 978-1-4503-2710-7