Parallel Algorithm for Approximate State Graph Exploration With Restricted Memory Footprint

Συγγραφείς: Keller, Jorg, Author, Litzinger, Sebastian, Author

Συνεισφορές: Keller, Jorg, Author, Litzinger, Sebastian, Author

Πηγή: Concurrency and Computation. 38(1)

Θεματικοί όροι: approximate computing, parallel graph algorithm, state transition graph

Περιγραφή αρχείου: electronic

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-220958
https://doi.org/10.1002/cpe.70502

A Practical Parallel Algorithm for Expander Decompositions

Συγγραφείς: Münk, Robin

Πηγή: Proceedings of the 38th ACM Symposium on Parallelism in Algorithms and Architectures. :50-61

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3816782.3819180

Hybrid Degree Aware Parallel Graph Traversal Using Distributed Priority Scheduling

Συγγραφείς: Shyma, P V, Sanil Shanker, Kp

Πηγή: 2026 International Conference on Computing, Communication, Security and Intelligent Systems (IC3SIS) Computing, Communication, Security and Intelligent Systems (IC3SIS), 2026 International Conference on. :1-7 May, 2026

Relation: 2026 International Conference on Computing, Communication, Security and Intelligent Systems (IC3SIS)

Parallel Graph Algorithms

Συγγραφείς: Erciyes, K.^Aff4

Συνεισφορές: Hazzan, Orit, Series Editor^Aff1, Maurer, Frank, Series Editor^Aff2, Erciyes, K.^Aff3

Πηγή: Guide to Graph Algorithms : Sequential, Parallel and Distributed. :77-116

Brief Announcement: PASGAL: Parallel And Scalable Graph Algorithm Library

Συγγραφείς: Dong, Xiaojun, Gu, Yan, Sun, Yihan, Wang, Letong

Πηγή: Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures. :439-441

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3626183.3660258

Design and Analysis of a Novel Parallel Algorithm for Large Scale Graph Optimization with Dynamic Load Balancing in Heterogeneous Computing Environments

Συγγραφείς: null Dedy Tri Cahyono, null Jaja Miharja

Πηγή: Programming and Algorithm Fundamentals. 1:01-10

A Parallel Graph Coloring Algorithm with Applications in Machine Learning

Συγγραφείς: Maedeh Yahaghi, Saeed Bakhshan

Πηγή: Computer Science and Machine Learning. :21-29

An Efficient Parallel Algorithm for Graph Processing in Cyber-Physical Systems

Συγγραφείς: Khurana, Meenu, Kumar, Sandeep, Srivastava, Arun Pratap, Badhoutiya, Arti, Khan, Akhilesh Kumar, Pant, Rajesh

Πηγή: 2024 4th International Conference on Innovative Practices in Technology and Management (ICIPTM) Innovative Practices in Technology and Management (ICIPTM), 2024 4th International Conference on. :1-6 Feb, 2024

Relation: 2024 4th International Conference on Innovative Practices in Technology and Management (ICIPTM)

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms

Συγγραφείς: Manohar, Magdalen Dobson, Shen, Zheqi, Blelloch, Guy, Dhulipala, Laxman, Gu, Yan, Simhadri, Harsha Vardhan, Sun, Yihan

Πηγή: Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming. :270-285

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3627535.3638475

Network Information Processing Analysis Based on Big Data Parallel Graph Partitioning Algorithm

Συγγραφείς: Keqing Guan, Xianli Kong

Πηγή: Journal of computing and information technology. 33(3)

Θεματικοί όροι: parallel graph partitioning algorithm, big data, distributed, network split, network information processing

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

Σύνδεσμος πρόσβασης: https://hrcak.srce.hr/336007
https://doi.org/10.20532/cit.2025.1005902
http://cit.fer.hr/index.php/CIT/article/view/5902

Parallel Batch Queries on Dynamic Trees: Algorithms and Experiments

Συγγραφείς: Ikram, Humza, Brady, Andrew, Anderson, Daniel, Blelloch, Guy E.

Πηγή: Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures. :525-539

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3694906.3743305

Parallel, Portable Algorithms for Distance-2 Maximal Independent Set and Graph Coarsening

Συγγραφείς: Kelley, Brian, Rajamanickam, Sivasankaran

Πηγή: 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS) IPDPS Parallel and Distributed Processing Symposium (IPDPS), 2022 IEEE International. :280-290 May, 2022

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

Three Algorithms for Parallel Graph Summarization.

Συγγραφείς: Blume, Till¹ (AUTHOR), Rau, Jannik² (AUTHOR), Richerby, David³ (AUTHOR), Scherp, Ansgar² (AUTHOR) ansgar.scherp@uni‐ulm.de

Πηγή: Expert Systems. Jan2026, Vol. 43 Issue 1, p1-23. 23p.

Θεματικοί όροι: *Batch processing, *Algorithms, Parallel algorithms, Graph algorithms, Graph theory, Computational complexity

PASGAL: Parallel And Scalable Graph Algorithm Library

Συγγραφείς: Dong, Xiaojun, Gu, Yan, Sun, Yihan, Wang, Letong

Θεματικοί όροι: Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2404.17101

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

Συγγραφείς: Davis, Timothy A.

Πηγή: ACM Transactions on Mathematical Software. 49(3):1-30

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3577195

Analysis of Parallel Graph Applications

Συγγραφείς: Atik, Funda, Yesil, Serif, Ouarnoughi, Hamza, Niar, Smail, Ozturk, Ozcan

Πηγή: 2024 IEEE 30th International Conference on Parallel and Distributed Systems (ICPADS) ICPADS Parallel and Distributed Systems (ICPADS), 2024 IEEE 30th International Conference on. :703-709 Oct, 2024

Relation: 2024 IEEE 30th International Conference on Parallel and Distributed Systems (ICPADS)

Parallel Algorithm for Approximate State Graph Exploration With Restricted Memory Footprint

Συγγραφείς: Keller, Jorg, Litzinger, Sebastian

Όροι ευρετηρίου: approximate computing; parallel graph algorithm; state transition graph, Computer Sciences, Datavetenskap (datalogi), Article in journal, info:eu-repo/semantics/article, text

Σύνδεσμος: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-220958
Concurrency and Computation, 1532-0626, 2026, 38:1

Parallel Algorithms for Finding Large Cliques in Sparse Graphs

Συγγραφείς: Gianinazzi, Lukas, Besta, Maciej, Schaffner, Yannick, Hoefler, Torsten

Πηγή: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. :243-253

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3409964.3461800

Parallel Graph Drawing Algorithm for Bipartite Planar Graphs

Συγγραφείς: Jain, Naman

Θεματικοί όροι: Computer Science - Computational Geometry

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2409.15400

High Probability Work Efficient Parallel Algorithms

Additional Titles: Randomized parallel algorithms for many fundamental problems achieve optimal linear work in expectation, but upgrading this guarantee to hold with high probability (whp) remains a recurring theoretical challenge. In this paper, we address this gap for several core parallel primitives. First, we present the first parallel semisort algorithm achieving $O(n)$ work and $O(\text{polylog } n)$ depth whp, improving upon the $O(n)$ expected work bound of Gu et al. [SPAA 2015]. Our analysis introduces new concentration arguments based on simple tabulation hashing and tail bounds for weighted sums of geometric random variables. As a corollary, we obtain an integer sorting algorithm for keys in $[n]$ matching the same bounds. Second, we introduce a framework for boosting randomized parallel graph algorithms from expected to high probability linear work. The framework applies to \emph{locally extendable} problems -- those admitting a deterministic procedure that extends a solution across a graph cut in work proportional to the cut size. We combine this with a \emph{culled balanced partition} scheme: an iterative culling phase removes a polylogarithmic number of high-degree vertices, after which the remaining graph admits a balanced random vertex whp via a bounded-differences argument. Applying work-inefficient whp subroutines to the small pieces and deterministic extension across cuts yields overall linear work whp. We instantiate this framework to obtain $O(m)$ work and polylogarithmic depth whp algorithms for $(Δ+1)$-vertex coloring and maximal independent set.

Συγγραφείς: Hutton, Chase, Melrod, Adam

Όροι ευρετηρίου: Data Structures and Algorithms, text

Σύνδεσμος: http://arxiv.org/abs/2603.00898