Irit Katriel and Hans L. Bodlaender Max-Planck-Institut fur Informatik,...  Home/Search
Context
Related
| mpisb.mpg.de/~irit/pub/TO.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mpisb.mpg.de/~irit/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: It is shown that the problem of maintaining the topological order of the nodes of a directed acyclic graph while inserting m edges can be solved in O(minfm log ng) time, an improvement over the best known result of O(mn). In addition, we analyze the complexity of the same algorithm with respect to the treewidth k of the underlying undirected graph. We show that the algorithm runs in time O(mk log n) for general k and that it can be implemented to run in O(n log n) time on trees,... (Update)
Active bibliography (related documents): More All
1.6: Online Topological Ordering - Katriel, Bodlaender (Correct)
1.4: Tree Decompositions With Small Cost - Irit Katriel Hans (2005) (Correct)
0.5: A Dynamic Algorithm for Topologically Sorting Directed Acyclic .. - Pearce, Kelly (2004) (Correct)
Similar documents based on text: More All
0.4: Fast Bound Consistency for the Global Cardinality Constraint - Katriel, Thiel (2003) (Correct)
0.3: A Characterization of the Degree Sequences of 2-trees - Katriel, Lotker (Correct)
0.3: A Practical Minimum Spanning Tree Algorithm Using the.. - Katriel, Sanders, Larsson (2002) (Correct)
BibTeX entry: (Update)
@misc{ and-online,
author = "Irit Katriel And",
title = "Online Topological Ordering",
url = "citeseer.ist.psu.edu/701069.html" }
Citations (may not include all citations):353 Fibonacci heaps and their uses in improved network optimizat.. (context) - Fredman, Tarjan - 1987
143 Algorithmic aspects of tree-width (context) - Robertson, Seymour - 1986
127 arboretum of graphs with bounded treewidth (context) - Bodlaender, k- - 1998
99 Two algorithms for maintaining order in a list (context) - Dietz, Sleator - 1987
58 Depth rst search and linear graph algorithms (context) - Tarjan - 1972
49 Incremental evaluation of computational circuits (context) - Alpern, Hoover et al. - 1990
26 the computational complexity of dynamic graph problems - Ramalingam, Reps - 1996
9 On competitive on-line algorithms for the dynamic priority-o.. (context) - Ramalingam, Reps - 1994
8 Maintaining a topological order under edge insertions (context) - Marchetti-Spaccamela, Nanni et al. - 1996
6 Two simpli ed algorithms for maintaining order in a list (context) - Bender, Cole et al. - 2002
4 On algorithms for online topological ordering and sorting (context) - Katriel - 2004
4 Sather language compilerdebugger implementation (context) - Lim, Sather et al. - 1992
3 line graph algorithms for incremental compilation (context) - Marchetti-Spaccamela, Nanni et al. - 1993
3 A dynamic algorithm for topologically sorting directed acycl.. - Pearce, Kelly - 2004
Documents on the same site (http://www.mpi-sb.mpg.de/~irit/): More
Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights - Katriel (2004) (Correct)
On the Algebraic Complexity of Set Equality and Inclusion - Katriel (Correct)
Fast Bound Consistency for the Global Cardinality Constraint - Katriel, Thiel (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC