Suchergebnisse - Parallel Graph Algorithms

Efficient and Scalable Parallel Graph Algorithms

Autoren: Wang, Letong

Schlagwörter: Computer science, Computer engineering, Graph Theory, Parallel Algorithms, Parallel Computing

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/775830dx
https://escholarship.org/content/qt775830dx/qt775830dx.pdf

Algorithm 1037: SuiteSparse:GraphBLAS: Parallel Graph Algorithms in the Language of Sparse Linear Algebra

Autoren: Timothy A. Davis

Quelle: ACM Transactions on Mathematical Software. 49:1-30

Schlagwörter: 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 0101 mathematics, 01 natural sciences

Massively parallel computation in a heterogeneous regime.

Autoren: Fischer, Orr Horowitz, Adi Oshman, Rotem

Quelle: Distributed Computing. Sep2025, Vol. 38 Issue 3, p185-206. 22p.

Schlagwörter: *GRAPH algorithms, *MATCHING theory, *PARALLEL programming

PASGAL: Parallel And Scalable Graph Algorithm Library

Autoren: Dong, Xiaojun Gu, Yan Sun, Yihan et al.

Schlagwörter: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC)

Zugangs-URL: http://arxiv.org/abs/2404.17101

Parallel Algorithms Can Be Provably Fast and Scalable

Autoren: Dong, Xiaojun

Schlagwörter: Computer science, Engineering, Artificial intelligence, Graph Algorithms, Integer Sorting, Parallel Algorithms, Semisorting, Shortest Paths, Sorting Algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/75n7m21g
https://escholarship.org/content/qt75n7m21g/qt75n7m21g.pdf

Dynamic constant time parallel graph algorithms with sub-linear work

Autoren: Schmidt, Jonas Schwentick, Thomas Jonas Schmidt and Thomas Schwentick

Weitere Verfasser: Schmidt, Jonas Schwentick, Thomas Jonas Schmidt and Thomas Schwentick

Schlagwörter: FOS: Computer and information sciences, Bipartiteness, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Dynamic parallel algorithms, Undirected connectivity

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2307.10107
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2023.80

Parallel graph algorithms in constant adaptive rounds: theory meets practice

Autoren: Behnezhad, Soheil Dhulipala, Laxman Esfandiari, Hossein et al.

Weitere Verfasser: Behnezhad, Soheil Dhulipala, Laxman Esfandiari, Hossein et al.

Quelle: VLDB Endowment

Schlagwörter: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://dspace.mit.edu/bitstream/1721.1/136701/1/3424573.3424579.pdf
http://arxiv.org/abs/2009.11552
http://dblp.uni-trier.de/db/journals/corr/corr2009.html#abs-2009-11552
https://dblp.uni-trier.de/db/journals/pvldb/pvldb13.html#BehnezhadDELMS20
https://doi.org/10.14778/3424573.3424579
https://dl.acm.org/doi/abs/10.14778/3424573.3424579
http://www.vldb.org/pvldb/vol13/p3588-behnezhad.pdf
https://hdl.handle.net/1721.1/136701

Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs

Autoren: Fuad Jamour Spiros Skiadopoulos Panos Kalnis et al.

Weitere Verfasser: Fuad Jamour Spiros Skiadopoulos Panos Kalnis et al.

Quelle: IEEE Transactions on Parallel and Distributed Systems. 29:659-672

Schlagwörter: Betweenness centrality, parallel graph algorithms, dynamic graph algorithms, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Dateibeschreibung: application/pdf

Zugangs-URL: https://repository.kaust.edu.sa/bitstream/10754/625935/1/08070346.pdf
https://dblp.uni-trier.de/db/journals/tpds/tpds29.html#JamourSK18
https://repository.kaust.edu.sa/handle/10754/625935
http://ieeexplore.ieee.org/abstract/document/8070346
https://doi.org/10.1109/TPDS.2017.2763951
https://ieeexplore.ieee.org/document/8070346

Series parallel linkages

We study spaces of realisations of linkages (weighted graphs) whose underlying graph is a series parallel graph. In particular, we describe an algorithm for determining whether or not such spaces are connected

Autoren: Cruickshank, James McLaughlin, Jonathan

Quelle: Publicacions Matemàtiques; Vol. 55, Núm. 2 (2011); p. 359 - 378

Schlagwörter: Linkage, series parallel graph, realisation, configuration space, moduli space

Dateibeschreibung: application/pdf

Relation: https://www.raco.cat/index.php/PublicacionsMatematiques/article/view/244959/387497

Zugangs-URL: https://www.raco.cat/index.php/PublicacionsMatematiques/article/view/244959

Euler Meets GPU: Practical Graph Algorithms with Theoretical Guarantees

Autoren: Polak, Adam Siwiec, Adrian Stobierski, Michal

Quelle: 2021 IEEE International Parallel and Distributed Processing Symposium (IPDPS). :233-244

Schlagwörter: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 02 engineering and technology, GRAPH ALGORITHMS, PARALLEL ALGORITHMS, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/pdf/2103.15217
http://arxiv.org/abs/2103.15217
https://dblp.uni-trier.de/db/journals/corr/corr2103.html#abs-2103-15217
https://ieeexplore.ieee.org/document/9460490/
https://arxiv.org/abs/2103.15217
https://ruj.uj.edu.pl/xmlui/handle/item/285122

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

Autoren: Dhulipala, Laxman Blelloch, Guy E Shun, Julian et al.

Weitere Verfasser: Dhulipala, Laxman Blelloch, Guy E Shun, Julian et al.

Quelle: MIT web domain

Schlagwörter: FOS: Computer and information sciences, Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms, 1. No poverty, 0202 electrical engineering, electronic engineering, information engineering, Data Structures and Algorithms (cs.DS), Distributed, Parallel, and Cluster Computing (cs.DC), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://dl.acm.org/doi/pdf/10.1145/3210377.3210414
https://dspace.mit.edu/bitstream/1721.1/135027/2/spaa2018.pdf
http://arxiv.org/abs/1805.05208
https://dl.acm.org/citation.cfm?id=3210414
https://dl.acm.org/doi/pdf/10.1145/3210377.3210414
https://dblp.uni-trier.de/db/journals/corr/corr1805.html#abs-1805-05208
http://ui.adsabs.harvard.edu/abs/2018arXiv180505208D/abstract
https://dblp.uni-trier.de/db/journals/topc/topc8.html#DhulipalaBS21
https://doi.org/10.1145/3434393
https://dl.acm.org/doi/10.1145/3434393
https://arxiv.org/pdf/1805.05208.pdf
https://arxiv.org/abs/1805.05208
https://hdl.handle.net/1721.1/135027

Communication-efficient Parallel Graph Algorithms

Autoren: Leiserson, Charles E. Maggs, Bruce M.

URL: https://hdl.handle.net/1721.1/149126
MIT-LCS-TM-318

Essentials of Parallel Graph Analytics

Autoren: Osama, Muhammad Porumbescu, Serban D Owens, John D

Schlagwörter: parallel, graph analytics, graph traversal, algorithms

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/2p19z28q
https://escholarship.org/content/qt2p19z28q/qt2p19z28q.pdf

Compact Graph Representations and Parallel Connectivity Algorithms for Massive Dynamic Network Analysis

Autoren: Madduri, Kamesh

Schlagwörter: Mathematics and Computing, graph algorithms, parallel algorithms, dynamic networks, social network analysis

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/06500983
https://escholarship.org/content/qt06500983/qt06500983.pdf

Efficient GPU algorithms for parallel decomposition of graphs into strongly connected and maximal end components

Autoren: Wijs, Anton Katoen, Joost-Pieter Bošnački, Dragan

Quelle: Formal methods in system design 48(3), 274-300 (2016). doi:10.1007/s10703-016-0246-7

Schlagwörter: Maximal end components, Strongly connected components, Hardware and Architecture, GPU, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Parallel graph algorithms, Probabilistic model checking, Software, Markov decision processes, Theoretical Computer Science

Zugangs-URL: https://link.springer.com/content/pdf/10.1007%2Fs10703-016-0246-7.pdf
https://research.tue.nl/en/publications/fbec4459-c3de-4824-a79c-4accac00aa62
https://doi.org/10.1007/s10703-016-0246-7
https://dblp.uni-trier.de/db/journals/fmsd/fmsd48.html#WijsKB16
https://paperity.org/p/75801580/efficient-gpu-algorithms-for-parallel-decomposition-of-graphs-into-strongly-connected-and
https://research.tue.nl/en/publications/efficient-gpu-algorithms-for-parallel-decomposition-of-graphs-int
https://link.springer.com/content/pdf/10.1007%2Fs10703-016-0246-7.pdf
https://pure.tue.nl/ws/files/53354111/art_3A10.1007_2Fs10703_016_0246_7.pdf
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2Ffbec4459-c3de-4824-a79c-4accac00aa62
https://publications.rwth-aachen.de/record/674301

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

Autoren: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Dhulipala, Laxman Blelloch, Guy E et al.

Quelle: MIT web domain

Index Begriffe: Article, http://purl.org/eprint/type/JournalArticle

URL: https://hdl.handle.net/1721.1/143885
10.1145/3434393
ACM Transactions on Parallel Computing

Parallel Multilevel k-Way Partitioning Scheme for Irregular Graphs

Autoren: Karypis, George Kumar, Vipin

Quelle: SIAM Review, 1999 Jun 01. 41(2), 278-300.

Zugangs-URL: https://www.jstor.org/stable/2653073

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

Autoren: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Dhulipala, Laxman Blelloch, Guy E et al.

Quelle: MIT web domain

Index Begriffe: Article, http://purl.org/eprint/type/ConferencePaper

URL: https://hdl.handle.net/1721.1/135027
10.1145/3210377.3210414
Annual ACM Symposium on Parallelism in Algorithms and Architectures

Coarse grained parallel algorithms for graph matching

Autoren: Chan, Albert Dehne, Frank Bose, Prosenjit et al.

Quelle: Parallel Computing. 34:47-62

Schlagwörter: Parallel algorithm, Convex bipartite graph, Coarse grained parallel computing, Unrooted tree, 0202 electrical engineering, electronic engineering, information engineering, Graph matching, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

MULTI-CORE PARALLEL GRAPH ALGORITHMS

Autoren: GUO, BIN Emil, Sekerinski Computing and Software

Weitere Verfasser: GUO, BIN Emil, Sekerinski Computing and Software

Schlagwörter: Graph Algorithm, Core Maintenance, Graph Trimming, Parallel, Multi-Core

Zugangs-URL: http://hdl.handle.net/11375/28562