Imagen de Portada

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Chang, Yi-Jun
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions
por: Chang, Yi-Jun, et al.
Publicado: (2022)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
por: Chang, Yi-Jun, et al.
Publicado: (2026)

Deterministic Expander Routing: Faster and More Versatile
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Bounded Memory in Distributed Networks
por: Basat, Ran Ben, et al.
Publicado: (2025)

Parallel Algorithms for Hierarchical Nucleus Decomposition
por: Shi, Jessica, et al.
Publicado: (2023)

Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model
por: Chang, Yi-Jun, et al.
Publicado: (2023)

Overlay Network Construction: Improved Overall and Node-Wise Message Complexity
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Round and Communication Efficient Graph Coloring
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Optimal Distributed Replacement Paths
por: Chang, Yi-Jun, et al.
Publicado: (2025)

Fast Broadcast in Highly Connected Networks
por: Chandra, Shashwat, et al.
Publicado: (2024)

Distributed Stochastic Graph Algorithms
por: Censor-Hillel, Keren, et al.
Publicado: (2026)

Distributed Graph Algorithms with Predictions
por: Boyar, Joan, et al.
Publicado: (2025)

Optimal local certification on graphs of bounded pathwidth
por: Baterisna, Dan Alden, et al.
Publicado: (2025)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
por: Ghaffari, Mohsen, et al.
Publicado: (2024)

Low-Distortion Clustering in Bounded Growth Graphs
por: Chang, Yi-Jun, et al.
Publicado: (2024)

Fast and Space-Efficient Parallel Algorithms for Influence Maximization
por: Wang, Letong, et al.
Publicado: (2023)

Two Efficient Message-passing Exclusive Scan Algorithms
por: Träff, Jesper Larsson
Publicado: (2026)

A Simple Distributed Algorithm for Sparse Fractional Covering and Packing Problems
por: Li, Qian, et al.
Publicado: (2024)

Distributed Approximation Algorithms for Minimum Dominating Set in Locally Nice Graphs
por: Bonamy, Marthe, et al.
Publicado: (2025)

Almost Optimal Algorithms for Token Collision in Anonymous Networks
por: Bai, Sirui, et al.
Publicado: (2024)

Fully-Distributed Byzantine Agreement in Sparse Networks
por: Augustine, John, et al.
Publicado: (2024)

Efficient Distributed Data Structures for Future Many-core Architectures
por: Fatourou, Panagiota, et al.
Publicado: (2024)

Improved All-Pairs Approximate Shortest Paths in Congested Clique
por: Bui, Hong Duc, et al.
Publicado: (2024)

The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting
por: Lechowicz, Adam, et al.
Publicado: (2023)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
por: Chang, Yi-Jun, et al.
Publicado: (2023)

Parallel $k$-Core Decomposition: Theory and Practice
por: Liu, Youzhe, et al.
Publicado: (2025)

ESCHER: Efficient and Scalable Hypergraph Evolution Representation with Application to Triad Counting
por: Shovan, S. M., et al.
Publicado: (2025)

Robust Distributed Arrays: Provably Secure Networking for Data Availability Sampling
por: Feist, Dankrad, et al.
Publicado: (2025)

Energy-Efficient Maximal Independent Sets in Radio Networks
por: Banasik, Dominick, et al.
Publicado: (2025)

Parallel $k$-Core Decomposition with Batched Updates and Asynchronous Reads
por: Liu, Quanquan C., et al.
Publicado: (2024)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
por: Blin, Lelia, et al.
Publicado: (2026)

DAG-Inducing Problems and Algorithms
por: Gupta, Arya Tanmay, et al.
Publicado: (2023)

Eventually Lattice-Linear Algorithms
por: Gupta, Arya Tanmay, et al.
Publicado: (2023)

Lock-Free Augmented Trees
por: Fatourou, Panagiota, et al.
Publicado: (2024)

Encoding Schemes for Parallel In-Place Algorithms
por: Hutton, Chase, et al.
Publicado: (2025)

Massively Parallel Algorithms for Approximate Shortest Paths
por: Dory, Michal, et al.
Publicado: (2024)

PASGAL: Parallel And Scalable Graph Algorithm Library
por: Dong, Xiaojun, et al.
Publicado: (2024)

Fully Scalable MPC Algorithms for Clustering in High Dimension
por: Czumaj, Artur, et al.
Publicado: (2023)

History Trees and Their Applications
por: Viglietta, Giovanni
Publicado: (2024)

Designing Parallel Algorithms for Community Detection using Arachne
por: Li, Fuhuan, et al.
Publicado: (2025)