A nonenumerative algorithm to find the k longest (shortest) paths in a DAG
In this paper, we present a novel and efficient algorithm to find the k longest (shortest) paths between sources and sinks in a directed acyclic graph (DAG). The algorithm does not enumerate paths therefore it is especially useful for very large k values. It is based on the Valued-Sum-of-Product (VS...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Kocan, Fatih |
| description | In this paper, we present a novel and efficient algorithm to find the k
longest (shortest) paths between sources and sinks in a directed acyclic graph
(DAG). The algorithm does not enumerate paths therefore it is especially useful
for very large k values. It is based on the Valued-Sum-of-Product (VSOP) tool,
which is an extension of Zero-suppressed Binary Decision Diagrams (ZBDDs). We
assessed the performance of this algorithm with a DAG model of a path-intensive
combinational circuit, viz. c6288, that has \sim10^{20} paths. We found that it
took about 64 minutes to compute all paths in this DAG along with their
lengths. |
| doi_str_mv | 10.48550/arxiv.1301.0181 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1301_0181</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1301_0181</sourcerecordid><originalsourceid>FETCH-LOGICAL-a651-8e813296d985ca86598c983775c812bbe7e562a54b846882ac0198ddff3f8aef3</originalsourceid><addsrcrecordid>eNotz7FOwzAUhWEvDKiwM6E7wpAQx7FzPUYFSlEllu7RTWI3FoldOaaCt4cC0_mnI32M3fAir1DK4oHipzvlXBQ8LzjyS_bagA_e-I_ZREruZICmQ4gujTOkANb5AdJo4B2m4A9mSXC3jCGmn7qHI6VxAeeB4LHZXLELS9Nirv93xfbPT_v1S7Z722zXzS4jJXmGBrkotRo0yp5QSY29RlHXskdedp2pjVQlyarDSiGW1Bdc4zBYKyySsWLFbv9ufy3tMbqZ4ld7NrVnk_gGGAtFuA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A nonenumerative algorithm to find the k longest (shortest) paths in a DAG</title><source>arXiv.org</source><creator>Kocan, Fatih</creator><creatorcontrib>Kocan, Fatih</creatorcontrib><description>In this paper, we present a novel and efficient algorithm to find the k
longest (shortest) paths between sources and sinks in a directed acyclic graph
(DAG). The algorithm does not enumerate paths therefore it is especially useful
for very large k values. It is based on the Valued-Sum-of-Product (VSOP) tool,
which is an extension of Zero-suppressed Binary Decision Diagrams (ZBDDs). We
assessed the performance of this algorithm with a DAG model of a path-intensive
combinational circuit, viz. c6288, that has \sim10^{20} paths. We found that it
took about 64 minutes to compute all paths in this DAG along with their
lengths.</description><identifier>DOI: 10.48550/arxiv.1301.0181</identifier><language>eng</language><subject>Computer Science - Data Structures and Algorithms</subject><creationdate>2013-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1301.0181$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1301.0181$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Kocan, Fatih</creatorcontrib><title>A nonenumerative algorithm to find the k longest (shortest) paths in a DAG</title><description>In this paper, we present a novel and efficient algorithm to find the k
longest (shortest) paths between sources and sinks in a directed acyclic graph
(DAG). The algorithm does not enumerate paths therefore it is especially useful
for very large k values. It is based on the Valued-Sum-of-Product (VSOP) tool,
which is an extension of Zero-suppressed Binary Decision Diagrams (ZBDDs). We
assessed the performance of this algorithm with a DAG model of a path-intensive
combinational circuit, viz. c6288, that has \sim10^{20} paths. We found that it
took about 64 minutes to compute all paths in this DAG along with their
lengths.</description><subject>Computer Science - Data Structures and Algorithms</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz7FOwzAUhWEvDKiwM6E7wpAQx7FzPUYFSlEllu7RTWI3FoldOaaCt4cC0_mnI32M3fAir1DK4oHipzvlXBQ8LzjyS_bagA_e-I_ZREruZICmQ4gujTOkANb5AdJo4B2m4A9mSXC3jCGmn7qHI6VxAeeB4LHZXLELS9Nirv93xfbPT_v1S7Z722zXzS4jJXmGBrkotRo0yp5QSY29RlHXskdedp2pjVQlyarDSiGW1Bdc4zBYKyySsWLFbv9ufy3tMbqZ4ld7NrVnk_gGGAtFuA</recordid><startdate>20130102</startdate><enddate>20130102</enddate><creator>Kocan, Fatih</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20130102</creationdate><title>A nonenumerative algorithm to find the k longest (shortest) paths in a DAG</title><author>Kocan, Fatih</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a651-8e813296d985ca86598c983775c812bbe7e562a54b846882ac0198ddff3f8aef3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Computer Science - Data Structures and Algorithms</topic><toplevel>online_resources</toplevel><creatorcontrib>Kocan, Fatih</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kocan, Fatih</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A nonenumerative algorithm to find the k longest (shortest) paths in a DAG</atitle><date>2013-01-02</date><risdate>2013</risdate><abstract>In this paper, we present a novel and efficient algorithm to find the k
longest (shortest) paths between sources and sinks in a directed acyclic graph
(DAG). The algorithm does not enumerate paths therefore it is especially useful
for very large k values. It is based on the Valued-Sum-of-Product (VSOP) tool,
which is an extension of Zero-suppressed Binary Decision Diagrams (ZBDDs). We
assessed the performance of this algorithm with a DAG model of a path-intensive
combinational circuit, viz. c6288, that has \sim10^{20} paths. We found that it
took about 64 minutes to compute all paths in this DAG along with their
lengths.</abstract><doi>10.48550/arxiv.1301.0181</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1301.0181 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1301_0181 |
| source | arXiv.org |
| subjects | Computer Science - Data Structures and Algorithms |
| title | A nonenumerative algorithm to find the k longest (shortest) paths in a DAG |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-30T21%3A51%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20nonenumerative%20algorithm%20to%20find%20the%20k%20longest%20(shortest)%20paths%20in%20a%20DAG&rft.au=Kocan,%20Fatih&rft.date=2013-01-02&rft_id=info:doi/10.48550/arxiv.1301.0181&rft_dat=%3Carxiv_GOX%3E1301_0181%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |