Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs

DOI10.1145/2591796.2591869zbMath1315.68280arXiv1504.07959OpenAlexW3098654413MaRDI QIDQ5259603

Sebastian Krinninger, Danupon Nanongkai, Monika R. Henzinger

Publication date: 26 June 2015

Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.07959

zbMATH Keywords

reachabilityshortest pathsdynamic graph algorithms

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Randomized algorithms (68W20)

Related Items (17)

Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs ⋮ Dynamic Single-Source Shortest Paths in Erdös-Rényi Random Graphs ⋮ Deterministic Near-Optimal Approximation Algorithms for Dynamic Set Cover ⋮ Unnamed Item ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Density Independent Algorithms for Sparsifying k-Step Random Walks ⋮ On efficient distributed construction of near optimal routing schemes ⋮ Incremental single-source shortest paths in digraphs with arbitrary positive arc weights ⋮ Unnamed Item ⋮ Dynamic graph coloring ⋮ Randomization for Efficient Dynamic Graph Algorithms ⋮ Maintaining Shortest Paths Under Deletions in Weighted Directed Graphs ⋮ Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization ⋮ Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time

Uses Software

• SuLQ

Cites Work

• Efficient algorithms for privately releasing marginals via convex relaxations
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Faster Algorithms for Privately Releasing Marginals
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately Releasing Conjunctions and the Statistical Query Barrier
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Lower Bounds in Differential Privacy
• Iterative Constructions and Private Data Release
• Characterizing the sample complexity of private learners
• Faster private release of marginals on small databases
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Collusion-secure fingerprinting for digital data
• On the complexity of differentially private data release
• Advances in Cryptology – CRYPTO 2004
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Theory of Cryptography
• Unnamed Item
• Unnamed Item

This page was built for publication: Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs