Title of article
Average-case analysis of incremental topological ordering Original Research Article
Author/Authors
Deepak Ajwani، نويسنده , , Tobias Friedrich، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
11
From page
240
To page
250
Abstract
Many applications like pointer analysis and incremental compilation require maintaining a topological ordering of the nodes of a directed acyclic graph (DAG) under dynamic updates. All known algorithms for this problem are either only analyzed for worst-case insertion sequences or only evaluated experimentally on random DAGs. We present the first average-case
Keywords
Average-case analysis , Dynamic graph algorithms , Random graphs
Journal title
Discrete Applied Mathematics
Serial Year
2010
Journal title
Discrete Applied Mathematics
Record number
887336
Link To Document