• Corpus ID: 5387266

Faster Algorithms for Online Topological Ordering

  title={Faster Algorithms for Online Topological Ordering},
  author={Telikepalli Kavitha and Rogers Mathew},
We present two algorithms for maintaining the topological order of a directed acyclic graph with n vertices, under an online edge insertion sequence of m edges. Efficient algorithms for online topological ordering have many applications, including online cycle detection, which is to discover the first edge that introduces a cycle under an arbitrary sequence of edge insertions in a directed graph. In this paper we present efficient algorithms for the online topological ordering problem. We… 

Figures from this paper

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
We present two online algorithms for maintaining a topological order of a directed n-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles m
Faster Algorithms for Incremental Topological Ordering
This work presents two online algorithms for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created, using a deterministic and a randomized method.
A New Approach to Incremental Cycle Detection and Related Problems
We consider the problem of detecting a cycle in a directed graph that grows by arc insertions and the related problems of maintaining a topological order and the strong components of such a graph.
Incremental Topological Ordering and Strong Component Maintenance
An on-line algorithm for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created, which takes O(m^{1/2}) amortized time per arc.
A new approach to incremental topological ordering
A new algorithm is presented that has a total cost of O(n2logn) for maintaining the topological ordering throughout all the edge additions of the graph G, and which is more efficient than existing algorithms.
Incremental Topological Sort and Cycle Detection in Õ ( m √ n ) Expected Total Time
A novel technique is introduced that allows us to improve upon the state of the art for a wide range of graph sparsity and has a total expected update time of Õ(m √ n) for both the incremental cycle detection and the topological sort problems.
A Labeling Approach to Incremental Cycle Detection
A new technique for incremental cycle detection is introduced that allows for both bounds (up to a logarithmic factor) to be obtained and seems more amiable for distributed implementation.
It is found that n-gram (i.e., repeated instruction sequences) parallelism does exist, but it is not easily leveraged and it is believed that efforts that consider input data can help liberate high-order parallelism from almost all "sequential" codes.
Recent Advances in Fully Dynamic Graph Algorithms
A quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms.


An O(n2.75) algorithm for online topological ordering
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
The results show the algorithm presented has marginally inferior time complexity but is the best for sparse graphs and, surprisingly, that an alternative with poor theoretical complexity performs marginally better on dense graphs.
On Competitive On-Line Algorithms for the Dynamic Priority-Ordering Problem
Online topological ordering
It is shown that the problem of maintaining the topological order of the nodes of a directed acyclic graph while inserting edges can be solved in O(n) time, an improvement over the best known result of <i>O</i>(<i>mn</i>).
Two algorithms for maintaining order in a list
The order maintenance problem is that of maintaining a list under a sequence of Insert and Delete operations, while answering Order queries (determine which of two elements comes first in the list).
Incremental evaluation of computational circuits
An O(y2 logy + S log 6) algorithm for the incremental circuit value problem is shown, which solves the problem without restricting the circuits or how they may change; it even tests for the accidental introduction of cycles when changing topology.
On-line Graph Algorithms for Incremental Compilation
Algorithms for the dynamic problems of loop detection, topological order, reachability from the start routine, and transitive closure are given.
Two Simplified Algorithms for Maintaining Order in a List
This work presents new algorithms that match the bounds of Dietz and Sleator, and presents experimental evidence that suggests that they are superior in practice.
Online cycle detection and difference propagation for pointer analysis
A new algorithm for online cycle detection, and a difference propagation technique which records changes in a variable's solution which reduces the execution time of interprocedural pointer analysis.