Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
København
1996
|
| Series: | Datalogisk Institut <København>: DIKU-Rapport
1996,2 |
| Subjects: | |
| Abstract: | Abstract: "We consider two different approaches to the problem of edge deletion in a graph after computation of all shortest paths -- Dynamization and Sensitivity. First we review the fastest dynamic algorithms to maintain all shortest paths after edge deletion. The algorithms are more efficient than re-computation from scratch but still has [sic] a high time complexity which is the motivation for a new kind of sensitivity algorithm. We show how to prepare the graph for two kinds of questions which both will be answered in time linear to the size of output. Question 1: given an edge, find all node pairs (x, y) for which the shortest path from x to y increases if the edge is deleted. Question 2: given a node pair (x, y), find those edges which if removed increases the cost of the path from x to y. The preparation of the graph is optimal and faster than computation of all shortest paths and does not require additional space." |
| Physical Description: | 7 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011046497 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 961108s1996 xx |||| 00||| engod | ||
| 035 | |a (OCoLC)38525436 | ||
| 035 | |a (DE-599)BVBBV011046497 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Alstrup, Stephen |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Dynamic and sensitivity algorithms for all shortest paths |c Stephen Alstrup og Peter W. Laudridsen |
| 264 | 1 | |a København |c 1996 | |
| 300 | |a 7 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1996,2 | |
| 520 | 3 | |a Abstract: "We consider two different approaches to the problem of edge deletion in a graph after computation of all shortest paths -- Dynamization and Sensitivity. First we review the fastest dynamic algorithms to maintain all shortest paths after edge deletion. The algorithms are more efficient than re-computation from scratch but still has [sic] a high time complexity which is the motivation for a new kind of sensitivity algorithm. We show how to prepare the graph for two kinds of questions which both will be answered in time linear to the size of output. Question 1: given an edge, find all node pairs (x, y) for which the shortest path from x to y increases if the edge is deleted. Question 2: given a node pair (x, y), find those edges which if removed increases the cost of the path from x to y. The preparation of the graph is optimal and faster than computation of all shortest paths and does not require additional space." | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Paths and cycles (Graph theory) | |
| 700 | 1 | |a Lauridsen, Peter W. |e Verfasser |4 aut | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1996,2 |w (DE-604)BV010011493 |9 1996,2 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-007397426 | |
Record in the Search Index
| DE-BY-TUM_call_number | 0111 2001 B 6064-1996,2 |
|---|---|
| DE-BY-TUM_katkey | 774454 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040020006482 |
| _version_ | 1821938642003689472 |
| any_adam_object | |
| author | Alstrup, Stephen Lauridsen, Peter W. |
| author_facet | Alstrup, Stephen Lauridsen, Peter W. |
| author_role | aut aut |
| author_sort | Alstrup, Stephen |
| author_variant | s a sa p w l pw pwl |
| building | Verbundindex |
| bvnumber | BV011046497 |
| ctrlnum | (OCoLC)38525436 (DE-599)BVBBV011046497 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01979nam a2200325 cb4500</leader><controlfield tag="001">BV011046497</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">961108s1996 xx |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38525436</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011046497</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Alstrup, Stephen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Dynamic and sensitivity algorithms for all shortest paths</subfield><subfield code="c">Stephen Alstrup og Peter W. Laudridsen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">København</subfield><subfield code="c">1996</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1996,2</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We consider two different approaches to the problem of edge deletion in a graph after computation of all shortest paths -- Dynamization and Sensitivity. First we review the fastest dynamic algorithms to maintain all shortest paths after edge deletion. The algorithms are more efficient than re-computation from scratch but still has [sic] a high time complexity which is the motivation for a new kind of sensitivity algorithm. We show how to prepare the graph for two kinds of questions which both will be answered in time linear to the size of output. Question 1: given an edge, find all node pairs (x, y) for which the shortest path from x to y increases if the edge is deleted. Question 2: given a node pair (x, y), find those edges which if removed increases the cost of the path from x to y. The preparation of the graph is optimal and faster than computation of all shortest paths and does not require additional space."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Paths and cycles (Graph theory)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Lauridsen, Peter W.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1996,2</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">1996,2</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007397426</subfield></datafield></record></collection> |
| id | DE-604.BV011046497 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T10:05:23Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007397426 |
| oclc_num | 38525436 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 7 S. |
| publishDate | 1996 |
| publishDateSearch | 1996 |
| publishDateSort | 1996 |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spellingShingle | Alstrup, Stephen Lauridsen, Peter W. Dynamic and sensitivity algorithms for all shortest paths Datalogisk Institut <København>: DIKU-Rapport Computational complexity Computer algorithms Paths and cycles (Graph theory) |
| title | Dynamic and sensitivity algorithms for all shortest paths |
| title_auth | Dynamic and sensitivity algorithms for all shortest paths |
| title_exact_search | Dynamic and sensitivity algorithms for all shortest paths |
| title_full | Dynamic and sensitivity algorithms for all shortest paths Stephen Alstrup og Peter W. Laudridsen |
| title_fullStr | Dynamic and sensitivity algorithms for all shortest paths Stephen Alstrup og Peter W. Laudridsen |
| title_full_unstemmed | Dynamic and sensitivity algorithms for all shortest paths Stephen Alstrup og Peter W. Laudridsen |
| title_short | Dynamic and sensitivity algorithms for all shortest paths |
| title_sort | dynamic and sensitivity algorithms for all shortest paths |
| topic | Computational complexity Computer algorithms Paths and cycles (Graph theory) |
| topic_facet | Computational complexity Computer algorithms Paths and cycles (Graph theory) |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT alstrupstephen dynamicandsensitivityalgorithmsforallshortestpaths AT lauridsenpeterw dynamicandsensitivityalgorithmsforallshortestpaths |
Branch Library Mathematics & Informatics, Reports
| Call Number: | 0111 2001 B 6064-1996,2 |
|---|---|
| Copy 1 | Available for loan On Shelf |