Copertina

Distance-based certification for leader election in meshed graphs and local recognition of their subclasses

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chalopin, Jérémie, Chepoi, Victor, Kokkou, Maria
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Distributed, Parallel, and Cluster Computing Discrete Mathematics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Lower bound for constant-size local certification
di: Martínez, Virgina Ardévol, et al.
Pubblicazione: (2022)

Leader Election via Unique Sink Orientation
di: Chalopin, Jérémie, et al.
Pubblicazione: (2025)

Local certification of geometric graph classes
di: Defrain, Oscar, et al.
Pubblicazione: (2023)

Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes
di: Chalopin, Jérémie, et al.
Pubblicazione: (2025)

Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory
di: Chalopin, Jérémie, et al.
Pubblicazione: (2024)

Deterministic Leader Election for Stationary Programmable Matter with Common Direction
di: Chalopin, Jérémie, et al.
Pubblicazione: (2024)

Complexity landscape for local certification
di: Bousquet, Nicolas, et al.
Pubblicazione: (2025)

Reductions in local certification
di: Esperet, Louis, et al.
Pubblicazione: (2025)

A subquadratic certification scheme for P5-free graphs
di: Bousquet, Nicolas, et al.
Pubblicazione: (2024)

Renaming in distributed certification
di: Bousquet, Nicolas, et al.
Pubblicazione: (2024)

Non-trivial automata networks do exist that solve the global majority problem with the local majority rule
di: Balbi, Pedro Paulo, et al.
Pubblicazione: (2026)

Local certification of forbidden subgraphs
di: Bousquet, Nicolas, et al.
Pubblicazione: (2024)

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
di: Döring, Michelle
Pubblicazione: (2025)

On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes
di: Li, Xiaorui, et al.
Pubblicazione: (2024)

SPHERE: Spherical partitioning for large-scale routing optimization
di: Lindermann, Robert Fabian, et al.
Pubblicazione: (2025)

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
di: Bonamy, Marthe, et al.
Pubblicazione: (2025)

Improved Distributed Algorithms for Random Colorings
di: Carlson, Charlie, et al.
Pubblicazione: (2023)

Jet: Multilevel Graph Partitioning on Graphics Processing Units
di: Gilbert, Michael S., et al.
Pubblicazione: (2023)

Convergence Sans Synchronization
di: Gupta, Arya Tanmay
Pubblicazione: (2025)

Efficient Computation in Congested Anonymous Dynamic Networks
di: Di Luna, Giuseppe A., et al.
Pubblicazione: (2023)

Asynchronous Cooperative Optimization of a Capacitated Vehicle Routing Problem Solution
di: Accorsi, Luca, et al.
Pubblicazione: (2025)

3-Majority and 2-Choices with Many Opinions
di: Shimizu, Nobutaka, et al.
Pubblicazione: (2025)

Optimal Computation in Anonymous Dynamic Networks
di: Di Luna, Giuseppe A., et al.
Pubblicazione: (2022)

Learning-Based Approaches for Job Shop Scheduling Problems: A Review
di: Rihane, Karima, et al.
Pubblicazione: (2025)

Real-Time Service Subscription and Adaptive Offloading Control in Vehicular Edge Computing
di: Gao, Chuanchao, et al.
Pubblicazione: (2025)

Efficient Approximation of Centrality Measures in Uncertain Graphs
di: Ketels, Daniel
Pubblicazione: (2024)

Asynchronous 3-Majority Dynamics with Many Opinions
di: Cooper, Colin, et al.
Pubblicazione: (2024)

Optimal Multilevel Slashing for Blockchains
di: Wood, Kenan, et al.
Pubblicazione: (2024)

Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence
di: Fuchs, Marc, et al.
Pubblicazione: (2025)

Algorithmics and Complexity of Cost-Driven Task Offloading with Submodular Optimization in Edge-Cloud Environments
di: Guo, Longkun, et al.
Pubblicazione: (2024)

Decompose, Optimize, and Reconstruct: Very Large Constant Multiplication at Scale
di: Cantaloube, Théo, et al.
Pubblicazione: (2026)

SUperman: Efficient Permanent Computation on GPUs
di: Elbek, Deniz, et al.
Pubblicazione: (2025)

Variant Codes Based on A Special Polynomial Ring and Their Fast Computations
di: Yu, Leilei, et al.
Pubblicazione: (2023)

Causal Graph Dynamics and Kan Extensions
di: Maignan, Luidnel, et al.
Pubblicazione: (2024)

Network Centrality as a New Perspective on Microservice Architecture
di: Bakhtin, Alexander, et al.
Pubblicazione: (2025)

A Dynamic Mode Decomposition Approach for Decentralized Spectral Clustering of Graphs
di: Zhu, Hongyu, et al.
Pubblicazione: (2022)

Fully-Automated Code Generation for Efficient Computation of Sparse Matrix Permanents on GPUs
di: Elbek, Deniz, et al.
Pubblicazione: (2025)

Fast algorithms for Vizing's theorem on bounded degree graphs
di: Bernshteyn, Anton, et al.
Pubblicazione: (2023)

Local Ratio based Real-time Job Offloading and Resource Allocation in Mobile Edge Computing
di: Gao, Chuanchao, et al.
Pubblicazione: (2025)

Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness
di: Chalopin, Jérémie, et al.
Pubblicazione: (2026)