Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 8 Oct 2018 in cs.DS | (1810.03491v1)

Abstract: We consider the problem of incremental cycle detection and topological ordering in a directed graph G=(V,E)G = (V, E) with ∣V∣=n|V| = n nodes. In this setting, initially the edge-set EE of the graph is empty. Subsequently, at each time-step an edge gets inserted into GG. 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 VV. Let mm be the total number of edges that get inserted into GG. We present a randomized algorithm for this problem with O~(m4/3)\tilde{O}(m^{4/3}) total expected update time.

Citations (17)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.