An Improved Algorithm for Incremental Cycle Detection and Topological Ordering in Sparse Graphs

by   Sayan Bhattacharya, et al.
University of Warwick

We consider the problem of incremental cycle detection and topological ordering in a directed graph G = (V, E) with |V| = n nodes. In this setting, initially the edge-set E of the graph is empty. Subsequently, at each time-step an edge gets inserted into G. After every edge-insertion, we have to report if the current graph contains a cycle, and as long as the graph remains acyclic, we have to maintain a topological ordering of the node-set V. Let m be the total number of edges that get inserted into G. We present a randomized algorithm for this problem with Õ(m^4/3) total expected update time.


page 1

page 2

page 3

page 4


Neural Topological Ordering for Computation Graphs

Recent works on machine learning for combinatorial optimization have sho...

DAG Learning on the Permutahedron

We propose a continuous optimization framework for discovering a latent ...

Hierarchical Topological Ordering with Conditional Independence Test for Limited Time Series

Learning directed acyclic graphs (DAGs) to identify causal relations und...

Distributed Monitoring of Topological Events via Homology

Topological event detection allows for the distributed computation of ho...

Incremental Dead State Detection in Logarithmic Time

Identifying live and dead states in an abstract transition system is a r...

Efficiently Exploring Ordering Problems through Conflict-directed Search

In planning and scheduling, solving problems with both state and tempora...

Dynamical SimRank Search on Time-Varying Networks

In this article, we study the efficient dynamical computation of all-pai...

Please sign up or login with your details

Forgot password? Click here to reset