Image de couverture de livre

Extremely Scalable Distributed Computation of Contour Trees via Pre-Simplification

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Li, Mingzhe, Carr, Hamish, Rübel, Oliver, Wang, Bei, Weber, Gunther H.
Format:	Preprint
Publié:	2025
Sujets:	Computational Geometry Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Lagrangian Simulation Volume-Based Contour Tree Simplification
par: Dilys, Domantas, et autres
Publié: (2025)

Distributed Augmentation, Hypersweeps, and Branch Decomposition of Contour Trees for Scientific Exploration
par: Li, Mingzhe, et autres
Publié: (2024)

A Surprisingly Simple Method for Distributed Euclidean-Minimum Spanning Tree / Single Linkage Dendrogram Construction from High Dimensional Embeddings via Distance Decomposition
par: Lettich, Richard
Publié: (2024)

Distributed-Memory Parallel Algorithms for Fixed-Radius Near Neighbor Graph Construction
par: Raulet, Gabriel, et autres
Publié: (2025)

Composable Coresets for Constrained Determinant Maximization and Beyond
par: Mahabadi, Sepideh, et autres
Publié: (2022)

On Distributed Computation of the Minimum Triangle Edge Transversal
par: Censor-Hillel, Keren, et autres
Publié: (2024)

Computing Least Fixed Points with Overwrite Semantics in Parallel and Distributed Systems
par: Garg, Vijay K., et autres
Publié: (2026)

Distributed Santa Claus via Global Rounding
par: de Vos, Tijn, et autres
Publié: (2026)

Faster Distributed $Δ$-Coloring via Ruling Subgraphs
par: Bourreau, Yann, et autres
Publié: (2025)

Tight Bounds on the Message Complexity of Distributed Tree Verification
par: Kutten, Shay, et autres
Publié: (2024)

Scalable Fault-Tolerant MapReduce
par: Hespe, Demian, et autres
Publié: (2024)

Faster Distributed $Δ$-Coloring via a Reduction to MIS
par: Bourreau, Yann, et autres
Publié: (2025)

Parallel Contraction Hierarchies Can Be Efficient and Scalable
par: Wan, Zijin, et autres
Publié: (2024)

PASGAL: Parallel And Scalable Graph Algorithm Library
par: Dong, Xiaojun, et autres
Publié: (2024)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
par: Baumecker, Malte, et autres
Publié: (2025)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
par: Khoury, Seri, et autres
Publié: (2025)

A Scalable and Unified Framework to Weighted Rank Aggregation
par: Carmel, Amir, et autres
Publié: (2026)

Fully Scalable MPC Algorithms for Euclidean k-Center
par: Czumaj, Artur, et autres
Publié: (2025)

Fully Scalable MPC Algorithms for Clustering in High Dimension
par: Czumaj, Artur, et autres
Publié: (2023)

Enhancing Scalability and Performance in Influence Maximization with Optimized Parallel Processing
par: Wu, Hanjiang, et autres
Publié: (2024)

ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
par: Shovan, S. M., et autres
Publié: (2025)

Restructuring expression dags for efficient parallelization
par: Wilhelm, Martin
Publié: (2018)

Distributed Stochastic Graph Algorithms
par: Censor-Hillel, Keren, et autres
Publié: (2026)

Optimal Distributed Replacement Paths
par: Chang, Yi-Jun, et autres
Publié: (2025)

Bounded Memory in Distributed Networks
par: Basat, Ran Ben, et autres
Publié: (2025)

Distributed Graph Algorithms with Predictions
par: Boyar, Joan, et autres
Publié: (2025)

Computing in a Faulty Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

Distributed Maximum Flow in Planar Graphs
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2024)

Fast Deterministic Distributed Degree Splitting
par: Maus, Yannic, et autres
Publié: (2026)

Meta-Theorems for Cuttable Distributed Problems
par: Bonamy, Marthe, et autres
Publié: (2026)

Distributed Subgraph Finding: Progress and Challenges
par: Censor-Hillel, Keren
Publié: (2022)

Towards Optimal Distributed Delta Coloring
par: Jakob, Manuel, et autres
Publié: (2025)

Local Density and its Distributed Approximation
par: Christiansen, Aleksander Bjørn, et autres
Publié: (2024)

$k$-Center Clustering in Distributed Models
par: Biabani, Leyla, et autres
Publié: (2024)

Efficient Dynamic MaxFlow Computation on GPUs
par: Kannappan, Shruthi, et autres
Publié: (2025)

Congested Clique Counting for Local Gibbs Distributions
par: Sobel, Joshua Z.
Publié: (2025)

The Local Information Cost of Distributed Graph Spanners
par: Robinson, Peter
Publié: (2020)

A Simple and Robust Protocol for Distributed Counting
par: Cohen, Edith, et autres
Publié: (2025)

Distributed Delta-Coloring under Bandwidth Limitations
par: Maus, Yannic, et autres
Publié: (2024)

Fully-Distributed Byzantine Agreement in Sparse Networks
par: Augustine, John, et autres
Publié: (2024)