A New Approach to Incremental Cycle Detection and Related Problems
From MaRDI portal
Publication:4962211
DOI10.1145/2756553zbMath1398.68386arXiv1112.0784OpenAlexW1558383352MaRDI QIDQ4962211
Jeremy T. Fineman, Michael A. Bender, Robert Endre Tarjan
Publication date: 30 October 2018
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.0784
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph ⋮ Automated verification of the parallel Bellman-Ford algorithm ⋮ Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification ⋮ Unnamed Item ⋮ Approximations of the Lagrange and Markov spectra ⋮ A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading ⋮ Beyond rankings: comparing directed acyclic graphs ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time
This page was built for publication: A New Approach to Incremental Cycle Detection and Related Problems
