Image de couverture de livre

Parallel Higher-order Truss Decomposition

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Chen, Qian, Jingya, Luo, Hui, Li, Yongye, Wang, Xiaoyang
Format:	Preprint
Publié:	2024
Sujets:	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

Hardness of Dynamic Core and Truss Decompositions
par: Couto, Yan S., et autres
Publié: (2025)

Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
par: Chen, Daoyuan, et autres
Publié: (2024)

Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees
par: Ghaffari, Mohsen, et autres
Publié: (2025)

On the Streaming Complexity of Expander Decomposition
par: Chen, Yu, et autres
Publié: (2024)

Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth
par: Agarwal, Arpit, et autres
Publié: (2024)

Non-Splitting Coflow Scheduling with Provable Guarantees in Heterogeneous Parallel Networks
par: Chen, Chi-Yeh
Publié: (2025)

Tighter Bounds on Non-clairvoyant Parallel Machine Scheduling with Prediction to Minimize Makespan
par: Chen, Tianqi, et autres
Publié: (2025)

Efficient Parallel Ising Samplers via Localization Schemes
par: Chen, Xiaoyu, et autres
Publié: (2025)

Improved Directed Expander Decompositions
par: Fleischmann, Henry, et autres
Publié: (2025)

Tree Embedding in High Dimensions: Dynamic and Massively Parallel
par: Goranci, Gramoz, et autres
Publié: (2025)

Simpler and Faster Directed Low-Diameter Decompositions
par: Li, Jason
Publié: (2025)

Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
par: Li, Xizhe, et autres
Publié: (2026)

Deterministic Padded Decompositions and Negative-Weight Shortest Paths
par: Li, Jason
Publié: (2025)

Faster Weak Expander Decompositions and Approximate Max Flow
par: Fleischmann, Henry, et autres
Publié: (2025)

Unbreakable Decomposition in Close-to-Linear Time
par: Anand, Aditya, et autres
Publié: (2024)

Provably Fast and Space-Efficient Parallel Biconnectivity
par: Dong, Xiaojun, et autres
Publié: (2023)

Parallel PLL on DAGs
par: Steil, Patrick
Publié: (2025)

Parallel Derandomization for Coloring
par: Coy, Sam, et autres
Publié: (2023)

Simultaneously Approximating All Norms for Massively Parallel Correlation Clustering
par: Cao, Nairen, et autres
Publié: (2024)

On Parallel $k$-Center Clustering
par: Coy, Sam, et autres
Publié: (2023)

Individual Fairness in Graph Decomposition
par: Munagala, Kamesh, et autres
Publié: (2024)

Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
par: Li, Jason, et autres
Publié: (2025)

Parallel Algorithms for Hierarchical Nucleus Decomposition
par: Shi, Jessica, et autres
Publié: (2023)

Engineering Optimal Parallel Task Scheduling
par: Akram, Matthew, et autres
Publié: (2024)

Compact Parallel Hash Tables on the GPU
par: Hegeman, Steef, et autres
Publié: (2024)

Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation
par: Haeupler, Bernhard, et autres
Publié: (2025)

Efficient Parallel Algorithms for Hypergraph Matching
par: Reinstädtler, Henrik, et autres
Publié: (2026)

$Δ$-Motif: Parallel Subgraph Isomorphism via Tabular Operations
par: Wang, Yulun, et autres
Publié: (2025)

Finding the Balance Rate of Uncertain Signed Graphs
par: Wang, Zeyu, et autres
Publié: (2026)

Width Parameters for Minimum Flow Decomposition
par: Grigorjew, Andreas, et autres
Publié: (2024)

Expander Decomposition with Almost Optimal Overhead
par: Bansal, Nikhil, et autres
Publié: (2026)

Simple Length-Constrained Expander Decompositions
par: Bodwin, Greg, et autres
Publié: (2025)

Compressing Suffix Trees by Path Decompositions
par: Becker, Ruben, et autres
Publié: (2025)

Breaking the $n^{1.5}$ Additive Error Barrier for Private and Efficient Graph Sparsification via Private Expander Decomposition
par: Aamand, Anders, et autres
Publié: (2025)

Network Design on Undirected Series-Parallel Graphs
par: Bansal, Ishan, et autres
Publié: (2024)

Scheduling Jobs with Work-Inefficient Parallel Solutions
par: Kuszmaul, William, et autres
Publié: (2024)

When to Give Up on a Parallel Implementation
par: Sheffield, Nathan S., et autres
Publié: (2024)

High Probability Work Efficient Parallel Algorithms
par: Hutton, Chase, et autres
Publié: (2026)

Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
par: Ghaffari, Mohsen, et autres
Publié: (2025)

Min-Sum Set Cover on Parallel Machines
par: Szyfelbein, Michał
Publié: (2026)