Anti-Section Transitive Closure

Authors: Green, Oded, Du, Zhihui, Patel, Sanyamee, Xie, Zehui, Liu, Hang, Bader, David A.

Source: 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

Authors: van der Grinten, Alexander, Meyerhenke, Henning

Source: 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

Authors: Ni, Peng, Hanai, Masatoshi, Tan, Wen Jun, Wang, Chen, Cai, Wentong

Source: 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

Authors: Keller, Jorg, Spenger, Gabriele, Wendzel, Steffen

Source: 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

Authors: Fu, Zhisong, Dasari, Harish Kumar, Bebee, Bradley, Berzins, Martin, Thompson, Bryan

Source: 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

Authors: Ceccarello M., Pietracaprina A., Pucci G., Upfal E.

Contributors: Ceccarello, M., Pietracaprina, A., Pucci, G., Upfal, E.

Subject Terms: Graph analytic, MapReduce, Parallel graph algorithm, Weighted diameter approximation, Weighted graph decomposition

File Description: 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

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

Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions

Authors: Becker, Ruben, Emek, Yuval, Ghaffari, Mohsen, Lenzen, Christoph

Contributors: Becker, Ruben, Emek, Yuval, Ghaffari, Mohsen, Lenzen, Christoph

Subject Terms: 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

Availability: 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

Authors: Syed, Shams-ul-Haq

Source: Theses and Dissertations

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

File Description: application/pdf

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

Availability: 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

Authors: Shozo Naito, Shigeru Masuyama

Source: Information Processing Letters. 44:7-10

Subject Terms: 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

File Description: application/xml

Access URL: 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

Authors: Sajal K. Das, Cui-Qing Yang

Source: Parallel Computing. 17:527-551

Subject Terms: 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

File Description: application/xml

Access URL: 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

Authors: Ma, Jun^{Aff1, IDArt7_cor1}, Ma, Shaohan

Source: Journal of Computer Science and Technology. 14(2):153-158

Solving some combinatorial problems on arrays with one-way dataflow

Authors: Savage, Carla D., Stallmann, Matthias, Perry, Jo Ellen

Source: 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

Authors: CECCARELLO, MATTEO, PIETRACAPRINA, ANDREA ALBERTO, PUCCI, GEPPINO, Upfal, Eli

Contributors: Ceccarello, Matteo, Pietracaprina, ANDREA ALBERTO, Pucci, Geppino, Upfal, Eli

Subject Terms: Graph Analytic, Parallel Graph Algorithm, Weighted Graph Decomposition, Weighted Diameter Approximation, MapReduce

File Description: 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

Availability: 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

Authors: CECCARELLO, MATTEO, PIETRACAPRINA, ANDREA ALBERTO, PUCCI, GEPPINO, E. Upfal

Contributors: Ceccarello, Matteo, Pietracaprina, ANDREA ALBERTO, Pucci, Geppino, E., Upfal

Subject Terms: Parallel Graph Algorithm, Graph Decomposition, k-Center Problem, Diameter Approximation, MapReduce

File Description: 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

Availability: 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

Authors: Yung H. Tsin

Source: Information Processing Letters. 20:143-146

Subject Terms: 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

File Description: application/xml

Access URL: 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

Authors: Tarjan, Robert E., Vishkin, Uzi

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

Subject Terms: 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

File Description: application/xml

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

An efficient parallel biconnectivity algorithm

Authors: Robert E. Tarjan

Contributors: The Pennsylvania State University CiteSeerX Archives

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

Subject Terms: Key words, parallel graph algorithm, biconnected components, blocks

File Description: 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

Availability: 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

Contributors: The Pennsylvania State University CiteSeerX Archives

Source: 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.

Subject Terms: Parallel graph algorithm, biconnected components

File Description: application/pdf

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

Availability: 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

Authors: Yung H. Tsin

Source: Information Processing Letters. 27:167-168

Subject Terms: 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

File Description: application/xml

Access URL: 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

Authors: Ibarra, Louis ^{∗∗, a, ∗}, Richards, Dana ^b

Source: In Parallel Computing 1993 19(8):873-886