Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society


On algorithms for online topological ordering and sorting

Katriel, Irit

MPI-I-2004-1-003. February 2004, 15 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
We derive several results about algorithms for the online
topological ordering and sorting problems. The main result
is that a slight variation on an algorithm by Alpern et al.
yields an amortized complexity of $\sqrt{m}\log n$ per edge
for an $n$-node $m$-edge DAG. This is an improvement, for all
except very dense graphs, over the best known previous result
of $O(n)$ per edge due to Marchetti-Spaccamela et al.
References to related material:

To download this research report, please select the type of document that fits best your needs.Attachement Size(s):
MPI-I-2004-1-003.ps238 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView
URL to this document:
Hide details for BibTeXBibTeX
  AUTHOR = {Katriel, Irit},
  TITLE = {On algorithms for online topological ordering and sorting},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Stuhlsatzenhausweg 85, 66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-2004-1-003},
  MONTH = {February},
  YEAR = {2004},
  ISSN = {0946-011X},