English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  An O(n^2.75) algorithm for online topological ordering

Ajwani, D., Friedrich, T., & Meyer, U. (2006). An O(n^2.75) algorithm for online topological ordering. In Algorithm theory - SWAT 2006: 10th Scandinavian Workshop on Algorithm Theory (pp. 53-64). Berlin, Germany: Springer.

Item is

Files

show Files
hide Files
:
2006SWATofficial_oto.pdf (Any fulltext), 481KB
 
File Permalink:
-
Name:
2006SWATofficial_oto.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Ajwani, Deepak1, Author           
Friedrich, Tobias1, Author           
Meyer, Ulrich1, Author           
Arge, Lars, Editor
Freivalds, Rusins, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: We present a simple algorithm which maintains the topological order of a directed acyclic graph with $n$ nodes under an online edge insertion sequence in $\O(n^{2.75})$ time, independent of the number of edges $m$ inserted. For dense DAGs, this is an improvement over the previous best result of $\O(\min\{m^{\frac{3}{2}} \log{n}, m^{\frac{3}{2}} + n^2 \log{n}\})$ by Katriel and Bodlaender. We also provide an empirical comparison of our algorithm with other algorithms for online topological sorting.

Details

show
hide
Language(s): eng - English
 Dates: 2007-03-072006
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 314669
Other: Local-ID: C1256428004B93B8-9A704547B66D15AAC12571430049F8F6-AFM06
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Riga, Latvia
Start-/End Date: 2006-07-06

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithm theory - SWAT 2006 : 10th Scandinavian Workshop on Algorithm Theory
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 53 - 64 Identifier: ISBN: 978-3-540-35753-7

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 4059 Sequence Number: - Start / End Page: - Identifier: -