Imagen de Portada

Triangle Centrality

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Burkhardt, Paul
Formato:	Preprint
Publicado:	2021
Materias:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Social and Information Networks
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On Distributed Computation of the Minimum Triangle Edge Transversal
por: Censor-Hillel, Keren, et al.
Publicado: (2024)

Improved Massively Parallel Triangle Counting in $O(1)$ Rounds
por: Liu, Quanquan C., et al.
Publicado: (2024)

Distributed Triangle Detection is Hard in Few Rounds
por: Assadi, Sepehr, et al.
Publicado: (2025)

Round-Delayed Amnesiac Flooding
por: Alafin, Oluwatobi, et al.
Publicado: (2026)

Memory Bounds for Concurrent Bounded Queues
por: Aksenov, Vitaly, et al.
Publicado: (2021)

Efficient Dynamic MaxFlow Computation on GPUs
por: Kannappan, Shruthi, et al.
Publicado: (2025)

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

Towards Optimal Distributed Edge Coloring with Fewer Colors
por: Jakob, Manuel, et al.
Publicado: (2025)

Perfect Matching with Few Link Activations
por: Mirault, Hugo, et al.
Publicado: (2025)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
por: Ghaffari, Mohsen, et al.
Publicado: (2025)

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

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

New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
por: Gil, Yuval, et al.
Publicado: (2025)

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

WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables
por: McCoy, Hunter, et al.
Publicado: (2025)

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

A Scalable and Unified Framework to Weighted Rank Aggregation
por: Carmel, Amir, et al.
Publicado: (2026)

FractalSortCPU: Bandwidth-Efficient Compressed Radix Sort on CPU
por: Dang'ana, Michael
Publicado: (2026)

Distributed Santa Claus via Global Rounding
por: de Vos, Tijn, et al.
Publicado: (2026)

Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
por: Baumecker, Malte, et al.
Publicado: (2025)

Paralleling and Accelerating Arc Consistency Enforcement with Recurrent Tensor Computations
por: Yang, Mingqi
Publicado: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
por: Wang, Letong, et al.
Publicado: (2024)

HiPerMotif: Novel Parallel Subgraph Isomorphism in Large-Scale Property Graphs
por: Dindoost, Mohammad, et al.
Publicado: (2025)

Improved Byzantine Agreement under an Adaptive Adversary
por: Dufoulon, Fabien, et al.
Publicado: (2025)

A Fast-Converging Decentralized Approach to the Weighted Minimum Vertex Cover Problem
por: Mordacchini, Matteo, et al.
Publicado: (2025)

Constrained Cuts, Flows, and Lattice-Linearity
por: Streit, Robert, et al.
Publicado: (2025)

Time-Optimal and Energy-Efficient Deterministic Consensus
por: Meir, Shachar, et al.
Publicado: (2025)

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

BLEST: Blazingly Efficient BFS using Tensor Cores
por: Elbek, Deniz, et al.
Publicado: (2025)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
por: Flin, Maxime, et al.
Publicado: (2026)

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

Efficient Distributed Decomposition and Routing Algorithms in Minor-Free Networks and Their Applications
por: Chang, Yi-Jun
Publicado: (2023)

Engineering A Workload-balanced Push-Relabel Algorithm for Massive Graphs on GPUs
por: Hsieh, Chou-Ying, et al.
Publicado: (2024)

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

Revising Apetrei's bounding volume hierarchy construction algorithm to allow stackless traversal
por: Prokopenko, Andrey, et al.
Publicado: (2024)

New Concurrent Order Maintenance Data Structure
por: Guo, Bin, et al.
Publicado: (2022)

Hash & Adjust: Competitive Demand-Aware Consistent Hashing
por: Pourdamghani, Arash, et al.
Publicado: (2024)

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

Weighted Matching in a Poly-Streaming Model
por: Ullah, Ahammed, et al.
Publicado: (2025)

Computing in a Faulty Congested Clique
por: Censor-Hillel, Keren, et al.
Publicado: (2025)