Výsledky vyhledávání - "Parallel Graph Algorithm"

Anti-Section Transitive Closure

Autoři: Green, Oded Du, Zhihui Patel, Sanyamee a další

Zdroj: Faculty Publications

Témata: Dynamic graph, GPU, Parallel graph algorithm, Transitive closure

Relation: https://digitalcommons.njit.edu/fac_pubs/4531

Dostupnost: https://digitalcommons.njit.edu/fac_pubs/4531
https://doi.org/10.1109/HiPC53243.2021.00033

Distributed graph diameter approximation

Autoři: Ceccarello M. Pietracaprina A. Pucci G. a další

Přispěvatelé: Ceccarello M. Pietracaprina A. Pucci G. a další

Témata: Graph analytic, MapReduce, Parallel graph algorithm, Weighted diameter approximation, Weighted graph decomposition

Popis souboru: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000578996500001; volume:13; issue:9; firstpage:216; numberofpages:23; journal:ALGORITHMS; https://hdl.handle.net/11577/3367804

Dostupnost: https://hdl.handle.net/11577/3367804
https://doi.org/10.3390/a13090216

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions

Autoři: Becker, Ruben Emek, Yuval Ghaffari, Mohsen a další

Přispěvatelé: Becker, Ruben Emek, Yuval Ghaffari, Mohsen a další

Témata: distributed graph algorithm, parallel graph algorithm, (semi-)streaming graph algorithm, metric tree embedding, low-stretch tree, graph decompositions, Settore INF/01 - Informatica

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:001185608700001; volume:53; issue:2; firstpage:247; lastpage:286; numberofpages:40; journal:SIAM JOURNAL ON COMPUTING; https://hdl.handle.net/10278/5068732

Dostupnost: https://hdl.handle.net/10278/5068732
https://doi.org/10.1137/22m1489034

On Parallelization of Graph Algorithms, Performance Modelling and Autonomous 3D Printable Object Synthesis

Autoři: Syed, Shams-ul-Haq

Zdroj: Theses and Dissertations

Témata: 3D object synthesis, graph algorithm, high performence computing, parallel graph algorithm, roofline model, vertex connectivity, Computer Sciences, Physical Sciences and Mathematics

Popis souboru: application/pdf

Relation: https://scholarcommons.sc.edu/etd/7672; https://scholarcommons.sc.edu/context/etd/article/8580/viewcontent/877703.pdf

Dostupnost: https://scholarcommons.sc.edu/etd/7672
https://scholarcommons.sc.edu/context/etd/article/8580/viewcontent/877703.pdf

Deciding whether graph G has page number one is in NC: Deciding whether graph \(G\) has page number one is in NC

Autoři: Shozo Naito Shigeru Masuyama

Zdroj: Information Processing Letters. 44:7-10

Témata: class NC, page number one, Analysis of algorithms and problem complexity, Graph theory (including graph drawing) in computer science, 4. Education, parallel graph algorithm, Distributed algorithms, 0102 computer and information sciences, forbidden subgraph, 01 natural sciences, 7. Clean energy, polylog time algorithm

Popis souboru: application/xml

Přístupová URL adresa: http://www.kurims.kyoto-u.ac.jp/~kyodo/kokyuroku/contents/pdf/0790-22.pdf
https://dblp.uni-trier.de/db/journals/ipl/ipl44.html#MasuyamaN92
http://ci.nii.ac.jp/naid/120001445060
https://www.sciencedirect.com/science/article/pii/002001909290247S

Performance of parallel spanning tree algorithms on linear arrays of transputers and unix systems: Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems

Autoři: Sajal K. Das Cui-Qing Yang

Zdroj: Parallel Computing. 17:527-551

Témata: Graph theory (including graph drawing) in computer science, parallel graph algorithm, transputer, 0202 electrical engineering, electronic engineering, information engineering, Distributed algorithms, 0102 computer and information sciences, 02 engineering and technology, Unix, 01 natural sciences, Performance evaluation, queueing, and scheduling in the context of computer systems

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/24155
https://doi.org/10.1016/s0167-8191(05)80155-3
https://www.sciencedirect.com/science/article/abs/pii/S0167819105801553
https://dblp.uni-trier.de/db/journals/pc/pc17.html#DasY91
https://ieeexplore.ieee.org/document/153774/
https://dblp.uni-trier.de/db/conf/ipps/ipps1991.html#DasY91
https://doi.org/10.1109/IPPS.1991.153774

A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs

Autoři: CECCARELLO, MATTEO PIETRACAPRINA, ANDREA ALBERTO PUCCI, GEPPINO a další

Přispěvatelé: CECCARELLO, MATTEO PIETRACAPRINA, ANDREA ALBERTO PUCCI, GEPPINO a další

Témata: Graph Analytic, Parallel Graph Algorithm, Weighted Graph Decomposition, Weighted Diameter Approximation, MapReduce

Popis souboru: CD-ROM

Relation: info:eu-repo/semantics/altIdentifier/wos/WOS:000391251800003; ispartofbook:Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS 2016); 30th International Parallel and Distributed Processing Symposium (IPDPS 2016); firstpage:1; lastpage:10; numberofpages:10; https://hdl.handle.net/11577/3191093

Dostupnost: https://hdl.handle.net/11577/3191093
https://doi.org/10.1109/IPDPS.2016.61

Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation

Autoři: CECCARELLO, MATTEO PIETRACAPRINA, ANDREA ALBERTO PUCCI, GEPPINO a další

Přispěvatelé: CECCARELLO, MATTEO PIETRACAPRINA, ANDREA ALBERTO PUCCI, GEPPINO a další

Témata: Parallel Graph Algorithm, Graph Decomposition, k-Center Problem, Diameter Approximation, MapReduce

Popis souboru: STAMPA

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-1-4503-3588-1; info:eu-repo/semantics/altIdentifier/wos/WOS:000569710500028; ispartofbook:Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures; 27th ACM Symposium on Parallelism in Algorithms and Architectures; firstpage:182; lastpage:191; numberofpages:10; https://hdl.handle.net/11577/3156391; http://dl.acm.org/citation.cfm?doid=2755573.2755591

Dostupnost: https://hdl.handle.net/11577/3156391
https://doi.org/10.1145/2755573.2755591
http://dl.acm.org/citation.cfm?doid=2755573.2755591

An optimal parallel processor bound in strong orientation of an undirected graph

Autoři: Yung H. Tsin

Zdroj: Information Processing Letters. 20:143-146

Témata: PRAM, Analysis of algorithms and problem complexity, parallel graph algorithm, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Graph theory, analysis of algorithms, undirected graph, SIMD shared memory model, Graph theory (including graph drawing) in computer science, 0202 electrical engineering, electronic engineering, information engineering, parallel computation, dense graphs

Popis souboru: application/xml

Přístupová URL adresa: https://www.sciencedirect.com/science/article/pii/0020019085900821
https://dblp.uni-trier.de/db/journals/ipl/ipl20.html#Tsin85

An Efficient Parallel Biconnectivity Algorithm: An efficient parallel biconnectivity algorithm

Autoři: Tarjan, Robert E. Vishkin, Uzi

Zdroj: SIAM Journal on Computing. 14:862-874

Témata: biconnected components, Connectivity, spanning tree, Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, parallel graph algorithm, blocks, 0102 computer and information sciences, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf

An efficient parallel biconnectivity algorithm

Autoři: Robert E. Tarjan The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Robert E. Tarjan The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf.

Témata: Key words, parallel graph algorithm, biconnected components, blocks

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.8898; http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.465.8898
http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf

FINDING BICONNECTED COMPONEMTS AND COMPUTING TREE FUNCTIONS IN LOGARITHMIC PARALLEL TIME Extended Summary

Přispěvatelé: The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.mpi-inf.mpg.de/departments/d1/teaching/ws10/models_of_computation/Tarjan, Vishkin - 1984 - Finding biconnected components and computing tree functions in logarithmic parallel time.pdf.

Témata: Parallel graph algorithm, biconnected components

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.3088

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.419.3088
http://www.mpi-inf.mpg.de/departments/d1/teaching/ws10/models_of_computation/Tarjan, Vishkin - 1984 - Finding biconnected components and computing tree functions in logarithmic parallel time.pdf

On handling vertex deletion in updating minimum spanning trees

Autoři: Yung H. Tsin

Zdroj: Information Processing Letters. 27:167-168

Témata: Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, updating of minimum spanning trees, parallel graph algorithm, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, parallel computation, vertex deletion, incremental algorithm, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/4055069
https://doi.org/10.1016/0020-0190(88)90020-8
http://doi.org/10.1016/0020-0190(88)90020-8
https://dblp.uni-trier.de/db/journals/ipl/ipl27.html#Tsin88
https://doi.org/10.1016/0020-0190(88)90020-8