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

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

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

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

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

Πηγή: Journal of Computing and Information Technology, Vol 33, Iss 3, Pp 139-155 (2025)

Θεματικοί όροι: big data, parallel graph partitioning algorithm, network information processing, distributed, network split, Electronic computers. Computer science, QA75.5-76.95

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

Relation: https://hrcak.srce.hr/file/485924; https://doaj.org/toc/1846-3908

Σύνδεσμος πρόσβασης: https://doaj.org/article/fd934148f77b46ef9d2988f0fdc4f63a

Efficient and Scalable Parallel Graph Algorithms

Συγγραφείς: Wang, Letong

Θεματικοί όροι: Computer science, Computer engineering, Graph Theory, Parallel Algorithms, Parallel Computing

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

Σύνδεσμος πρόσβασης: https://escholarship.org/uc/item/775830dx
https://escholarship.org/content/qt775830dx/qt775830dx.pdf

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)

A Parallel Graph Algorithm for Detecting Mesh Singularities in Distributed Memory Ice Sheet Simulations

Συγγραφείς: Bogle, Ian, Devine, Karen, Perego, Mauro, Rajamanickam, Sivasankaran, Slota, George M.

Πηγή: Proceedings of the 48th International Conference on Parallel Processing. :1-10

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

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

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

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

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

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

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

Data Structures for Efficient Parallel Graph Processing

Συγγραφείς: Jiang, Xinjian

Θεματικοί όροι: Computer science, Computer engineering, Applied mathematics, hierarchical bit vectors, parallel data structures, parallel graph algorithms, priority queues, vertex subsets

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

Σύνδεσμος πρόσβασης: https://escholarship.org/uc/item/9ph1j7m9
https://escholarship.org/content/qt9ph1j7m9/qt9ph1j7m9.pdf

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

Συγγραφείς: Dhulipala, Laxman, Blelloch, Guy E., Shun, Julian

Πηγή: ACM Transactions on Parallel Computing (TOPC). 8(1):1-70

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

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable

Συγγραφείς: Dhulipala, Laxman, Blelloch, Guy E., Shun, Julian

Πηγή: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures. :393-404

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

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update

Συγγραφείς: Blelloch, Guy E., Brady, Andrew C.

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

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

Julienne : A Framework for Parallel Graph Algorithms using Work-efficient Bucketing

Συγγραφείς: Dhulipala, Laxman, Blelloch, Guy, Shun, Julian

Πηγή: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures. :293-304

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

Parallel graph algorithms by blocks : from I/O to algorithms

Συγγραφείς: Yaşar, Abdurrahman, Gabert, Kasimir, Çatalyürek, Ümit V.

Πηγή: Proceedings of the 18th ACM International Conference on Computing Frontiers. :212-212

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

Scalable Fine-Grained Parallel Cycle Enumeration Algorithms

Συγγραφείς: Blanusa, Jovan, Ienne, Paolo, Atasu, Kubilay

Πηγή: Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures. :247-258

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