Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Meher Chaitanya"'
Autor:
Meher Chaitanya, Ulrik Brandes
Publikováno v:
Complex Networks & Their Applications X ISBN: 9783030934125
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d7a389ac6fdf5b485cacee853cf8d784
https://doi.org/10.1007/978-3-030-93413-2_18
https://doi.org/10.1007/978-3-030-93413-2_18
Publikováno v:
IPDPS Workshops
Graph algorithms play an important role in several fields of sciences and engineering. Prominent among them are the All-Pairs-Shortest-Paths ( APSP ) and related problems. Indeed there are several efficient implementations for such problems on a vari
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea04312497d396f7ef78b855d63d0be2
https://doi.org/10.15803/ijnc.8.1_73
https://doi.org/10.15803/ijnc.8.1_73
Autor:
Meher Chaitanya, Kishore Kothapalli
Publikováno v:
International Journal of Networking and Computing. 6:87-106
In this paper we design and implement an algorithm for finding the biconnected components of a given graph. Our algorithm is based on experimental evidence that finding the bridges of a graph is usually easier and faster in the parallel setting. We u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::218aa829fcc6ac6b7a0d8dd8dcfb5386
https://doi.org/10.15803/ijnc.6.1_87
https://doi.org/10.15803/ijnc.6.1_87
Publikováno v:
Journal of Parallel and Distributed Computing. 76:81-93
Graph algorithms play a prominent role in several fields of sciences and engineering. Notable among them are graph traversal, finding the connected components of a graph, and computing shortest paths. There are several efficient implementations of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1424a26441f58e804ddff146905ecdf2
https://doi.org/10.1016/j.jpdc.2014.11.006
https://doi.org/10.1016/j.jpdc.2014.11.006
Publikováno v:
HiPC
Parallel graph algorithms continue to attract a lotof research attention given their applications to several fields ofsciences and engineering. Efficient design and implementation ofgraph algorithms on modern manycore accelerators has to how-ever con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7773c436eed2d05cec3914e16652ead3
https://doi.org/10.1109/hipc.2016.043
https://doi.org/10.1109/hipc.2016.043