Computing $$k$$ shortest paths from a source node to each other node
Abstract The single-pair K shortest path (KSP) problem can be described as finding $$k$$ least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devot...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Liu, Guisong [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2014 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer-Verlag Berlin Heidelberg 2014 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Soft computing - Springer Berlin Heidelberg, 1997, 19(2014), 8 vom: 21. Aug., Seite 2391-2402 |
|---|---|
| Übergeordnetes Werk: |
volume:19 ; year:2014 ; number:8 ; day:21 ; month:08 ; pages:2391-2402 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00500-014-1434-2 |
|---|
| Katalog-ID: |
OLC2034878183 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2034878183 | ||
| 003 | DE-627 | ||
| 005 | 20230502111709.0 | ||
| 007 | tu | ||
| 008 | 200820s2014 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00500-014-1434-2 |2 doi | |
| 035 | |a (DE-627)OLC2034878183 | ||
| 035 | |a (DE-He213)s00500-014-1434-2-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 082 | 0 | 4 | |a 004 |q VZ |
| 084 | |a 11 |2 ssgn | ||
| 100 | 1 | |a Liu, Guisong |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Computing $$k$$ shortest paths from a source node to each other node |
| 264 | 1 | |c 2014 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag Berlin Heidelberg 2014 | ||
| 520 | |a Abstract The single-pair K shortest path (KSP) problem can be described as finding $$k$$ least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly $$k$$ distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems. | ||
| 650 | 4 | |a K shortest path problem | |
| 650 | 4 | |a Single-pair KSP | |
| 650 | 4 | |a Single-source KSP | |
| 700 | 1 | |a Qiu, Zhao |4 aut | |
| 700 | 1 | |a Qu, Hong |4 aut | |
| 700 | 1 | |a Ji, Luping |4 aut | |
| 700 | 1 | |a Takacs, Alexander |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Soft computing |d Springer Berlin Heidelberg, 1997 |g 19(2014), 8 vom: 21. Aug., Seite 2391-2402 |w (DE-627)231970536 |w (DE-600)1387526-7 |w (DE-576)060238259 |x 1432-7643 |7 nnns |
| 773 | 1 | 8 | |g volume:19 |g year:2014 |g number:8 |g day:21 |g month:08 |g pages:2391-2402 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00500-014-1434-2 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_267 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_4277 | ||
| 951 | |a AR | ||
| 952 | |d 19 |j 2014 |e 8 |b 21 |c 08 |h 2391-2402 | ||
| author_variant |
g l gl z q zq h q hq l j lj a t at |
|---|---|
| matchkey_str |
article:14327643:2014----::optnkhretahfoaoreoe |
| hierarchy_sort_str |
2014 |
| publishDate |
2014 |
| allfields |
10.1007/s00500-014-1434-2 doi (DE-627)OLC2034878183 (DE-He213)s00500-014-1434-2-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Liu, Guisong verfasserin aut Computing $$k$$ shortest paths from a source node to each other node 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2014 Abstract The single-pair K shortest path (KSP) problem can be described as finding $$k$$ least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly $$k$$ distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems. K shortest path problem Single-pair KSP Single-source KSP Qiu, Zhao aut Qu, Hong aut Ji, Luping aut Takacs, Alexander aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 19(2014), 8 vom: 21. Aug., Seite 2391-2402 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:19 year:2014 number:8 day:21 month:08 pages:2391-2402 https://doi.org/10.1007/s00500-014-1434-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 19 2014 8 21 08 2391-2402 |
| spelling |
10.1007/s00500-014-1434-2 doi (DE-627)OLC2034878183 (DE-He213)s00500-014-1434-2-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Liu, Guisong verfasserin aut Computing $$k$$ shortest paths from a source node to each other node 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2014 Abstract The single-pair K shortest path (KSP) problem can be described as finding $$k$$ least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly $$k$$ distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems. K shortest path problem Single-pair KSP Single-source KSP Qiu, Zhao aut Qu, Hong aut Ji, Luping aut Takacs, Alexander aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 19(2014), 8 vom: 21. Aug., Seite 2391-2402 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:19 year:2014 number:8 day:21 month:08 pages:2391-2402 https://doi.org/10.1007/s00500-014-1434-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 19 2014 8 21 08 2391-2402 |
| allfields_unstemmed |
10.1007/s00500-014-1434-2 doi (DE-627)OLC2034878183 (DE-He213)s00500-014-1434-2-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Liu, Guisong verfasserin aut Computing $$k$$ shortest paths from a source node to each other node 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2014 Abstract The single-pair K shortest path (KSP) problem can be described as finding $$k$$ least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly $$k$$ distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems. K shortest path problem Single-pair KSP Single-source KSP Qiu, Zhao aut Qu, Hong aut Ji, Luping aut Takacs, Alexander aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 19(2014), 8 vom: 21. Aug., Seite 2391-2402 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:19 year:2014 number:8 day:21 month:08 pages:2391-2402 https://doi.org/10.1007/s00500-014-1434-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 19 2014 8 21 08 2391-2402 |
| allfieldsGer |
10.1007/s00500-014-1434-2 doi (DE-627)OLC2034878183 (DE-He213)s00500-014-1434-2-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Liu, Guisong verfasserin aut Computing $$k$$ shortest paths from a source node to each other node 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2014 Abstract The single-pair K shortest path (KSP) problem can be described as finding $$k$$ least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly $$k$$ distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems. K shortest path problem Single-pair KSP Single-source KSP Qiu, Zhao aut Qu, Hong aut Ji, Luping aut Takacs, Alexander aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 19(2014), 8 vom: 21. Aug., Seite 2391-2402 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:19 year:2014 number:8 day:21 month:08 pages:2391-2402 https://doi.org/10.1007/s00500-014-1434-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 19 2014 8 21 08 2391-2402 |
| allfieldsSound |
10.1007/s00500-014-1434-2 doi (DE-627)OLC2034878183 (DE-He213)s00500-014-1434-2-p DE-627 ger DE-627 rakwb eng 004 VZ 004 VZ 11 ssgn Liu, Guisong verfasserin aut Computing $$k$$ shortest paths from a source node to each other node 2014 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag Berlin Heidelberg 2014 Abstract The single-pair K shortest path (KSP) problem can be described as finding $$k$$ least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly $$k$$ distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems. K shortest path problem Single-pair KSP Single-source KSP Qiu, Zhao aut Qu, Hong aut Ji, Luping aut Takacs, Alexander aut Enthalten in Soft computing Springer Berlin Heidelberg, 1997 19(2014), 8 vom: 21. Aug., Seite 2391-2402 (DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 1432-7643 nnns volume:19 year:2014 number:8 day:21 month:08 pages:2391-2402 https://doi.org/10.1007/s00500-014-1434-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 AR 19 2014 8 21 08 2391-2402 |
| language |
English |
| source |
Enthalten in Soft computing 19(2014), 8 vom: 21. Aug., Seite 2391-2402 volume:19 year:2014 number:8 day:21 month:08 pages:2391-2402 |
| sourceStr |
Enthalten in Soft computing 19(2014), 8 vom: 21. Aug., Seite 2391-2402 volume:19 year:2014 number:8 day:21 month:08 pages:2391-2402 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
K shortest path problem Single-pair KSP Single-source KSP |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Soft computing |
| authorswithroles_txt_mv |
Liu, Guisong @@aut@@ Qiu, Zhao @@aut@@ Qu, Hong @@aut@@ Ji, Luping @@aut@@ Takacs, Alexander @@aut@@ |
| publishDateDaySort_date |
2014-08-21T00:00:00Z |
| hierarchy_top_id |
231970536 |
| dewey-sort |
14 |
| id |
OLC2034878183 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2034878183</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502111709.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2014 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-014-1434-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2034878183</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00500-014-1434-2-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Liu, Guisong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computing $$k$$ shortest paths from a source node to each other node</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag Berlin Heidelberg 2014</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The single-pair K shortest path (KSP) problem can be described as finding $$k$$ least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly $$k$$ distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">K shortest path problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Single-pair KSP</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Single-source KSP</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Qiu, Zhao</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Qu, Hong</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ji, Luping</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Takacs, Alexander</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft computing</subfield><subfield code="d">Springer Berlin Heidelberg, 1997</subfield><subfield code="g">19(2014), 8 vom: 21. Aug., Seite 2391-2402</subfield><subfield code="w">(DE-627)231970536</subfield><subfield code="w">(DE-600)1387526-7</subfield><subfield code="w">(DE-576)060238259</subfield><subfield code="x">1432-7643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:19</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:8</subfield><subfield code="g">day:21</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:2391-2402</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00500-014-1434-2</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">19</subfield><subfield code="j">2014</subfield><subfield code="e">8</subfield><subfield code="b">21</subfield><subfield code="c">08</subfield><subfield code="h">2391-2402</subfield></datafield></record></collection>
|
| author |
Liu, Guisong |
| spellingShingle |
Liu, Guisong ddc 004 ssgn 11 misc K shortest path problem misc Single-pair KSP misc Single-source KSP Computing $$k$$ shortest paths from a source node to each other node |
| authorStr |
Liu, Guisong |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)231970536 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1432-7643 |
| topic_title |
004 VZ 11 ssgn Computing $$k$$ shortest paths from a source node to each other node K shortest path problem Single-pair KSP Single-source KSP |
| topic |
ddc 004 ssgn 11 misc K shortest path problem misc Single-pair KSP misc Single-source KSP |
| topic_unstemmed |
ddc 004 ssgn 11 misc K shortest path problem misc Single-pair KSP misc Single-source KSP |
| topic_browse |
ddc 004 ssgn 11 misc K shortest path problem misc Single-pair KSP misc Single-source KSP |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Soft computing |
| hierarchy_parent_id |
231970536 |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
Soft computing |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)231970536 (DE-600)1387526-7 (DE-576)060238259 |
| title |
Computing $$k$$ shortest paths from a source node to each other node |
| ctrlnum |
(DE-627)OLC2034878183 (DE-He213)s00500-014-1434-2-p |
| title_full |
Computing $$k$$ shortest paths from a source node to each other node |
| author_sort |
Liu, Guisong |
| journal |
Soft computing |
| journalStr |
Soft computing |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2014 |
| contenttype_str_mv |
txt |
| container_start_page |
2391 |
| author_browse |
Liu, Guisong Qiu, Zhao Qu, Hong Ji, Luping Takacs, Alexander |
| container_volume |
19 |
| class |
004 VZ 11 ssgn |
| format_se |
Aufsätze |
| author-letter |
Liu, Guisong |
| doi_str_mv |
10.1007/s00500-014-1434-2 |
| dewey-full |
004 |
| title_sort |
computing $$k$$ shortest paths from a source node to each other node |
| title_auth |
Computing $$k$$ shortest paths from a source node to each other node |
| abstract |
Abstract The single-pair K shortest path (KSP) problem can be described as finding $$k$$ least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly $$k$$ distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems. © Springer-Verlag Berlin Heidelberg 2014 |
| abstractGer |
Abstract The single-pair K shortest path (KSP) problem can be described as finding $$k$$ least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly $$k$$ distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems. © Springer-Verlag Berlin Heidelberg 2014 |
| abstract_unstemmed |
Abstract The single-pair K shortest path (KSP) problem can be described as finding $$k$$ least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly $$k$$ distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems. © Springer-Verlag Berlin Heidelberg 2014 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT GBV_ILN_70 GBV_ILN_267 GBV_ILN_2018 GBV_ILN_4277 |
| container_issue |
8 |
| title_short |
Computing $$k$$ shortest paths from a source node to each other node |
| url |
https://doi.org/10.1007/s00500-014-1434-2 |
| remote_bool |
false |
| author2 |
Qiu, Zhao Qu, Hong Ji, Luping Takacs, Alexander |
| author2Str |
Qiu, Zhao Qu, Hong Ji, Luping Takacs, Alexander |
| ppnlink |
231970536 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00500-014-1434-2 |
| up_date |
2024-07-03T22:49:36.193Z |
| _version_ |
1803599978110648320 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2034878183</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502111709.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2014 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00500-014-1434-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2034878183</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00500-014-1434-2-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Liu, Guisong</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computing $$k$$ shortest paths from a source node to each other node</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2014</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag Berlin Heidelberg 2014</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract The single-pair K shortest path (KSP) problem can be described as finding $$k$$ least cost paths through a graph between two given nodes in a non-decreasing order, while single-source KSP algorithms aim to find KSPs from a given node to each other node. However, little effort has been devoted to the single-source KSP approaches. This paper proposes a novel single-source KSP algorithm in a given directed weighted graph where loops are allowed. The proposed method is designed to compute a set of shortest paths with exactly $$k$$ distinctive lengths in a non-decreasing order. Meanwhile, it can also find all shortest paths with the length less than a given threshold. Inspired by water flowing principle, we imagine that there are waters flowing from a source node to each other node along edges at a constant speed. When the water reaches a node, the node will generate new waters flowing along its outgoing edges. By stepping back the traces of the water, the ordered shortest paths can be obtained. We also address the correctness and effectiveness of the method. Simulations are carried out using synthetic data and practical graph data, which demonstrate the considerable performance of the proposed approach especially for single-source KSP problems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">K shortest path problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Single-pair KSP</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Single-source KSP</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Qiu, Zhao</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Qu, Hong</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ji, Luping</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Takacs, Alexander</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Soft computing</subfield><subfield code="d">Springer Berlin Heidelberg, 1997</subfield><subfield code="g">19(2014), 8 vom: 21. Aug., Seite 2391-2402</subfield><subfield code="w">(DE-627)231970536</subfield><subfield code="w">(DE-600)1387526-7</subfield><subfield code="w">(DE-576)060238259</subfield><subfield code="x">1432-7643</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:19</subfield><subfield code="g">year:2014</subfield><subfield code="g">number:8</subfield><subfield code="g">day:21</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:2391-2402</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00500-014-1434-2</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">19</subfield><subfield code="j">2014</subfield><subfield code="e">8</subfield><subfield code="b">21</subfield><subfield code="c">08</subfield><subfield code="h">2391-2402</subfield></datafield></record></collection>
|
| score |
7.4014387 |