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 with nodes. In this setting, initially the edge-set of the graph is empty. Subsequently, at each time-step an edge gets inserted into . 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 . Let be the total number of edges that get inserted into . We present a randomized algorithm for this problem with total expected update time.
Paper Prompts
Sign up for free to create and run prompts on this paper.