ConnectIt: a framework for static and incremental parallel graph connectivity algorithms

ConnectIt: a framework for static and incremental parallel graph connectivity algorithms

© VLDB Endowment. All rights reserved. Connected components is a fundamental kernel in graph applications. The fastest existing multicore algorithms for solving graph connectivity are based on some form of edge sampling and/or linking and compressing trees. However, many combinations of these design...

书目详细资料
Main Authors:	Dhulipala, Laxman, Hong, Changwan, Shun, Julian
其他作者:	Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
格式:	文件
语言:	English
出版:	VLDB Endowment 2021
在线阅读:	https://hdl.handle.net/1721.1/133950

相似书籍

Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs
由: Hong, Changwan, et al.
出版: (2021)

Exploring the Design Space of Static and Incremental Graph Connectivity Algorithms on GPUs
由: Hong, Changwan, et al.
出版: (2022)

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
由: Dhulipala, Laxman, et al.
出版: (2021)

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable
由: Dhulipala, Laxman, et al.
出版: (2022)

Parallel Index-Based Structural Graph Clustering and Its Approximation
由: Tseng, Tom, et al.
出版: (2022)

Parallel Algorithms for Hierarchical Nucleus Decomposition
由: Shi, Jessica, et al.
出版: (2024)

Parallel Batch-Dynamic Algorithms for k-Core Decomposition and Related Graph Problems
由: Liu, Quanquan, et al.
出版: (2022)

Parallel Batch-Dynamic Minimum Spanning Forest and the Efficiency of Dynamic Agglomerative Graph Clustering
由: Tseng, Tom, et al.
出版: (2022)

Sage: parallel semi-asymmetric graph algorithms for NVRAMs
由: Dhulipala, Laxman, et al.
出版: (2021)

Parallelism in Randomized Incremental Algorithms
由: Blelloch, Guy, et al.
出版: (2022)

Theoretically and practically efficient parallel nucleus decomposition
由: Shi, Jessica, et al.
出版: (2022)

Theoretically and Practically Efficient Parallel Nucleus Decomposition (Abstract)
由: Shi, Jessica, et al.
出版: (2023)

Optimizing ordered graph algorithms with GraphIt
由: Zhang, Yunming, et al.
出版: (2021)

ParChain: a framework for parallel hierarchical agglomerative clustering using nearest-neighbor chain
由: Yu, Shangdi, et al.
出版: (2022)

Optimizing ordered graph algorithms with GraphIt
由: Zhang, Yunming, et al.
出版: (2022)

Parallel graph algorithms in constant adaptive rounds: theory meets practice
由: Behnezhad, Soheil, et al.
出版: (2021)

Low-latency graph streaming using compressed purely-functional trees
由: Dhulipala, Laxman, et al.
出版: (2021)

ParGeo: A Library for Parallel Computational Geometry
由: Wang, Yiqiu, et al.
出版: (2022)

Incremental static point load tests on precast concrete beam column connections /
由: 191652 Lim, Jee Hock, et al.
出版: (2009)

Randomized Incremental Convex Hull is Highly Parallel
由: Blelloch, Guy, et al.
出版: (2022)

The Graph Based Benchmark Suite (GBBS)
由: Dhulipala, Laxman, et al.
出版: (2021)

The Graph Based Benchmark Suite (GBBS)
由: Dhulipala, Laxman, et al.
出版: (2022)

Algorithmic aspects of graph connectivity /
由: Nagamochi, Hiroshi, 1960-, et al.
出版: (2008)

Connectivity Algorithm in Simple Graphs
由: Reza Wafdan, et al.
出版: (2014-07-01)

Connectivity Algorithm in Simple Graphs
由: Reza Wafdan, et al.
出版: (2014-07-01)

Increasing Parallelism in Forward-backward Distributed Algorithm for Finding Strongly Connected Components of Directed Graphs
由: Dominik Ryżko
出版: (2024-07-01)

Parallel Algorithms for Computer Vision on the Connection Machine
由: Little, James J.
出版: (2004)

Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
由: Zhen-Mu Hong, et al.
出版: (2021-01-01)

Connectivity in probabilistic graphs
出版: (2004)

Dual Connectivity in Graphs
由: Mohammed A. Mutar, et al.
出版: (2025-01-01)

Connected coalitions in graphs
由: Saeid Alikhani, et al.
出版: (2024-01-01)

Every $3$-connected, essentially $11$-connected line graph is hamiltonian
由: Hong-Jian Lai, et al.
出版: (2005-01-01)

The Connected Detour Numbers of Special Classes of Connected Graphs
由: Ahmed M. Ali, et al.
出版: (2019-01-01)

On the Eccentric Connectivity Polynomial of ℱ-Sum of Connected Graphs
由: Muhammad Imran, et al.
出版: (2020-01-01)

Parallel graph algorithm
由: Nguyen, Duc Hieu.
出版: (2012)

Implicit Decomposition for Write-Efficient Connectivity Algorithms
由: Ben-David, Naama, et al.
出版: (2021)

Stability Improvement of Parallel-Connected Inverters Under Very Weak Distorted Grid Using Observer-Based Incremental Control Scheme
由: Thuy Vi Tran, et al.
出版: (2023-01-01)

Balancing connected colourings of graphs
由: Illingworth, F, et al.
出版: (2023)

Hamilton-Connected Mycielski Graphs∗
由: Yuanyuan Shen, et al.
出版: (2021-01-01)

On the Connectivity of Token Graphs of Trees
由: Ruy Fabila-Monroy, et al.
出版: (2022-03-01)