Anti-Section Transitive Closure

Συγγραφείς: Green, Oded, Du, Zhihui, Patel, Sanyamee, Xie, Zehui, Liu, Hang, Bader, David A.

Πηγή: 2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC) HIPC High Performance Computing, Data, and Analytics (HiPC), 2021 IEEE 28th International Conference on. :192-201 Dec, 2021

Relation: 2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)

Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling

Συγγραφείς: van der Grinten, Alexander, Meyerhenke, Henning

Πηγή: 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS) Parallel and Distributed Processing Symposium (IPDPS), 2020 IEEE International. :527-535 May, 2020

Relation: 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS)

Parallel Algorithm for Single-Source Earliest-Arrival Problem in Temporal Graphs

Συγγραφείς: Ni, Peng, Hanai, Masatoshi, Tan, Wen Jun, Wang, Chen, Cai, Wentong

Πηγή: 2017 46th International Conference on Parallel Processing (ICPP) ICPP Parallel Processing (ICPP), 2017 46th International Conference on. :493-502 Aug, 2017

Relation: 2017 46th International Conference on Parallel Processing (ICPP)

Ant Colony-Inspired Parallel Algorithm to Improve Cryptographic Pseudo Random Number Generators

Συγγραφείς: Keller, Jorg, Spenger, Gabriele, Wendzel, Steffen

Πηγή: 2017 IEEE Security and Privacy Workshops (SPW) SPW Security and Privacy Workshops (SPW), 2017 IEEE. :17-22 May, 2017

Relation: 2017 IEEE Security and Privacy Workshops (SPW)

Parallel Breadth First Search on GPU clusters

Συγγραφείς: Fu, Zhisong, Dasari, Harish Kumar, Bebee, Bradley, Berzins, Martin, Thompson, Bryan

Πηγή: 2014 IEEE International Conference on Big Data (Big Data) Big Data (Big Data), 2014 IEEE International Conference on. :110-118 Oct, 2014

Relation: 2014 IEEE International Conference on Big Data (Big Data)

Distributed graph diameter approximation

Συγγραφείς: Ceccarello M., Pietracaprina A., Pucci G., Upfal E.

Συνεισφορές: Ceccarello, M., Pietracaprina, A., Pucci, G., Upfal, E.

Θεματικοί όροι: Graph analytic, MapReduce, Parallel graph algorithm, Weighted diameter approximation, Weighted graph decomposition

Περιγραφή αρχείου: 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

Διαθεσιμότητα: https://hdl.handle.net/11577/3367804
https://doi.org/10.3390/a13090216

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions

Συγγραφείς: Becker, Ruben, Emek, Yuval, Ghaffari, Mohsen, Lenzen, Christoph

Συνεισφορές: Becker, Ruben, Emek, Yuval, Ghaffari, Mohsen, Lenzen, Christoph

Θεματικοί όροι: 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

Διαθεσιμότητα: 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

Συγγραφείς: Syed, Shams-ul-Haq

Πηγή: Theses and Dissertations

Θεματικοί όροι: 3D object synthesis, graph algorithm, high performence computing, parallel graph algorithm, roofline model, vertex connectivity, Computer Sciences, Physical Sciences and Mathematics

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: 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

Συγγραφείς: Shozo Naito, Shigeru Masuyama

Πηγή: Information Processing Letters. 44:7-10

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Sajal K. Das, Cui-Qing Yang

Πηγή: Parallel Computing. 17:527-551

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

An efficient parallel graph edge matching algorithm and its applications

Συγγραφείς: Ma, Jun^{Aff1, IDArt7_cor1}, Ma, Shaohan

Πηγή: Journal of Computer Science and Technology. 14(2):153-158

Solving some combinatorial problems on arrays with one-way dataflow

Συγγραφείς: Savage, Carla D., Stallmann, Matthias, Perry, Jo Ellen

Πηγή: Algorithmica: An International Journal in Computer Science. June 1990 5(1-4):179-199

A Practical Parallel Algorithm for Diameter Approximation of Massive Weighted Graphs

Συγγραφείς: CECCARELLO, MATTEO, PIETRACAPRINA, ANDREA ALBERTO, PUCCI, GEPPINO, Upfal, Eli

Συνεισφορές: Ceccarello, Matteo, Pietracaprina, ANDREA ALBERTO, Pucci, Geppino, Upfal, Eli

Θεματικοί όροι: Graph Analytic, Parallel Graph Algorithm, Weighted Graph Decomposition, Weighted Diameter Approximation, MapReduce

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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

Συγγραφείς: CECCARELLO, MATTEO, PIETRACAPRINA, ANDREA ALBERTO, PUCCI, GEPPINO, E. Upfal

Συνεισφορές: Ceccarello, Matteo, Pietracaprina, ANDREA ALBERTO, Pucci, Geppino, E., Upfal

Θεματικοί όροι: Parallel Graph Algorithm, Graph Decomposition, k-Center Problem, Diameter Approximation, MapReduce

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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

Συγγραφείς: Yung H. Tsin

Πηγή: Information Processing Letters. 20:143-146

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Συγγραφείς: Tarjan, Robert E., Vishkin, Uzi

Πηγή: SIAM Journal on Computing. 14:862-874

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf

An efficient parallel biconnectivity algorithm

Συγγραφείς: Robert E. Tarjan

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.umiacs.umd.edu/users/vishkin/TEACHING/ENEE759KS12/TV85.pdf.

Θεματικοί όροι: Key words, parallel graph algorithm, biconnected components, blocks

Περιγραφή αρχείου: 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

Διαθεσιμότητα: 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

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: 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.

Θεματικοί όροι: Parallel graph algorithm, biconnected components

Περιγραφή αρχείου: application/pdf

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

Διαθεσιμότητα: 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

Συγγραφείς: Yung H. Tsin

Πηγή: Information Processing Letters. 27:167-168

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: 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

Efficient parallel graph algorithms based on open ear decomposition

Συγγραφείς: Ibarra, Louis ^{∗∗, a, ∗}, Richards, Dana ^b

Πηγή: In Parallel Computing 1993 19(8):873-886