A dynamic topological sort algorithm for directed acyclic graphs
We consider the problem of maintaining the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, although this has inferior time complexity compared with the best previously known result, we find that its simplicity lead...
Gespeichert in:
Veröffentlicht in: | The ACM journal of experimental algorithmics 2007-02, Vol.11 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | The ACM journal of experimental algorithmics |
container_volume | 11 |
creator | Pearce, David J. Kelly, Paul H. J. |
description | We consider the problem of maintaining the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, although this has inferior time complexity compared with the best previously known result, we find that its simplicity leads to better performance in practice. In addition, we provide an empirical comparison against the three main alternatives over a large number of random DAGs. The results show our algorithm is the best for sparse digraphs and only a constant factor slower than the best on dense digraphs. |
doi_str_mv | 10.1145/1187436.1210590 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_30945089</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>30945089</sourcerecordid><originalsourceid>FETCH-LOGICAL-c253t-7b576c0d7b279a9fb01e3ec0fcc86aadb12d37c7a47f88c7214127e0a7d34023</originalsourceid><addsrcrecordid>eNpNkD1PwzAURS0EEqUws3piS_ue7cTJRlXxJVVi6W45z04b5NTBTof-e4rowHTvcHSGw9gjwgJRlUvEWitZLVAglA1csRlCrYqqKtX1v3_L7nL-AkAJUs7Y84q708EOPfEpjjHEXU828BzTxG3YxdRP-4F3MXHXJ0-Td9zSicKZ3yU77vM9u-lsyP7hsnO2fX3Zrt-Lzefbx3q1KUiUcip0W-qKwOlW6MY2XQvopSfoiOrKWteicFKTtkp3dU1aoEKhPVjtpAIh5-zpTzum-H30eTJDn8mHYA8-HrOR0KgS6uYMLv9ASjHn5Dszpn6w6WQQzG8ocwllLqHkD98EWsw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>30945089</pqid></control><display><type>article</type><title>A dynamic topological sort algorithm for directed acyclic graphs</title><source>ACM Digital Library Complete</source><creator>Pearce, David J. ; Kelly, Paul H. J.</creator><creatorcontrib>Pearce, David J. ; Kelly, Paul H. J.</creatorcontrib><description>We consider the problem of maintaining the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, although this has inferior time complexity compared with the best previously known result, we find that its simplicity leads to better performance in practice. In addition, we provide an empirical comparison against the three main alternatives over a large number of random DAGs. The results show our algorithm is the best for sparse digraphs and only a constant factor slower than the best on dense digraphs.</description><identifier>ISSN: 1084-6654</identifier><identifier>EISSN: 1084-6654</identifier><identifier>DOI: 10.1145/1187436.1210590</identifier><language>eng</language><ispartof>The ACM journal of experimental algorithmics, 2007-02, Vol.11</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c253t-7b576c0d7b279a9fb01e3ec0fcc86aadb12d37c7a47f88c7214127e0a7d34023</citedby><cites>FETCH-LOGICAL-c253t-7b576c0d7b279a9fb01e3ec0fcc86aadb12d37c7a47f88c7214127e0a7d34023</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Pearce, David J.</creatorcontrib><creatorcontrib>Kelly, Paul H. J.</creatorcontrib><title>A dynamic topological sort algorithm for directed acyclic graphs</title><title>The ACM journal of experimental algorithmics</title><description>We consider the problem of maintaining the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, although this has inferior time complexity compared with the best previously known result, we find that its simplicity leads to better performance in practice. In addition, we provide an empirical comparison against the three main alternatives over a large number of random DAGs. The results show our algorithm is the best for sparse digraphs and only a constant factor slower than the best on dense digraphs.</description><issn>1084-6654</issn><issn>1084-6654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><recordid>eNpNkD1PwzAURS0EEqUws3piS_ue7cTJRlXxJVVi6W45z04b5NTBTof-e4rowHTvcHSGw9gjwgJRlUvEWitZLVAglA1csRlCrYqqKtX1v3_L7nL-AkAJUs7Y84q708EOPfEpjjHEXU828BzTxG3YxdRP-4F3MXHXJ0-Td9zSicKZ3yU77vM9u-lsyP7hsnO2fX3Zrt-Lzefbx3q1KUiUcip0W-qKwOlW6MY2XQvopSfoiOrKWteicFKTtkp3dU1aoEKhPVjtpAIh5-zpTzum-H30eTJDn8mHYA8-HrOR0KgS6uYMLv9ASjHn5Dszpn6w6WQQzG8ocwllLqHkD98EWsw</recordid><startdate>20070209</startdate><enddate>20070209</enddate><creator>Pearce, David J.</creator><creator>Kelly, Paul H. J.</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20070209</creationdate><title>A dynamic topological sort algorithm for directed acyclic graphs</title><author>Pearce, David J. ; Kelly, Paul H. J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c253t-7b576c0d7b279a9fb01e3ec0fcc86aadb12d37c7a47f88c7214127e0a7d34023</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pearce, David J.</creatorcontrib><creatorcontrib>Kelly, Paul H. J.</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>The ACM journal of experimental algorithmics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Pearce, David J.</au><au>Kelly, Paul H. J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A dynamic topological sort algorithm for directed acyclic graphs</atitle><jtitle>The ACM journal of experimental algorithmics</jtitle><date>2007-02-09</date><risdate>2007</risdate><volume>11</volume><issn>1084-6654</issn><eissn>1084-6654</eissn><abstract>We consider the problem of maintaining the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, although this has inferior time complexity compared with the best previously known result, we find that its simplicity leads to better performance in practice. In addition, we provide an empirical comparison against the three main alternatives over a large number of random DAGs. The results show our algorithm is the best for sparse digraphs and only a constant factor slower than the best on dense digraphs.</abstract><doi>10.1145/1187436.1210590</doi></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1084-6654 |
ispartof | The ACM journal of experimental algorithmics, 2007-02, Vol.11 |
issn | 1084-6654 1084-6654 |
language | eng |
recordid | cdi_proquest_miscellaneous_30945089 |
source | ACM Digital Library Complete |
title | A dynamic topological sort algorithm for directed acyclic graphs |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-24T03%3A09%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20dynamic%20topological%20sort%20algorithm%20for%20directed%20acyclic%20graphs&rft.jtitle=The%20ACM%20journal%20of%20experimental%20algorithmics&rft.au=Pearce,%20David%20J.&rft.date=2007-02-09&rft.volume=11&rft.issn=1084-6654&rft.eissn=1084-6654&rft_id=info:doi/10.1145/1187436.1210590&rft_dat=%3Cproquest_cross%3E30945089%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=30945089&rft_id=info:pmid/&rfr_iscdi=true |