Cover Image

Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Sudo, Yuichi, Kitamura, Naoki, Shibata, Masahiro, Nakamura, Junya, Tixeuil, Sébastien, Masuzawa, Toshimitsu, Wada, Koichi
Format:	Preprint
Published:	2026
Subjects:	Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-linear Time Dispersion of Mobile Agents
by: Sudo, Yuichi, et al.
Published: (2023)

Self-stabilizing Graph Exploration by a Single Agent
by: Sudo, Yuichi, et al.
Published: (2020)

Two-Robot Computational Landscape: A Complete Characterization of Model Power in Minimal Mobile Robot Systems
by: Kitamura, Naoki, et al.
Published: (2025)

Stand-Up Indulgent Gathering on Lines for Myopic Luminous Robots
by: Bramas, Quentin, et al.
Published: (2023)

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
by: Sudo, Yuichi
Published: (2025)

On the Solvability of Byzantine-tolerant Reliable Communication in Dynamic Networks
by: Bonomi, Silvia, et al.
Published: (2025)

Deterministic Self-Stabilizing BFS Construction in Constant Space
by: Blin, Lélia, et al.
Published: (2025)

Complete Graph Identification in Population Protocols
by: Kanaya, Haruki, et al.
Published: (2024)

Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols
by: Araya, Takumi, et al.
Published: (2024)

Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
by: Takahashi, Shota, et al.
Published: (2025)

Stand-Up Indulgent Gathering on Rings
by: Bramas, Quentin, et al.
Published: (2024)

Data Poisoning Attacks in Gossip Learning
by: Pham, Alexandre, et al.
Published: (2024)

Emergent Peer-to-Peer Multi-Hub Topology
by: Legheraba, Mohamed Amine, et al.
Published: (2024)

A New Probabilistic Mobile Byzantine Failure Model for Self-Protecting Systems
by: Bonomi, Silvia, et al.
Published: (2025)

Selection Guidelines for Geo-Replicated SMR Protocols: A Communication Pattern-based Latency Modeling Approach
by: Shiozaki, Kohya, et al.
Published: (2024)

Dynatune: Dynamic Tuning of Raft Election Parameters Using Network Measurement
by: Shiozaki, Kohya, et al.
Published: (2025)

Pairbot: A Novel Model for Autonomous Mobile Robot Systems Consisting of Paired Robots
by: Kim, Yonghwan, et al.
Published: (2020)

Tight Lower Bounds in the Supported LOCAL Model
by: Balliu, Alkida, et al.
Published: (2024)

Rise and Shine Efficiently! Tight Bounds for Adversarial Wake-up
by: Robinson, Peter, et al.
Published: (2024)

The R(1)W(1) Communication Model for Self-Stabilizing Distributed Algorithms
by: Kakugawa, Hirotsugu, et al.
Published: (2025)

LIFT: Byzantine Resilient Hub-Sampling
by: Legheraba, Mohamed Amine, et al.
Published: (2026)

Efficient Self-stabilizing Simulations of Energy-Restricted Mobile Robots by Asynchronous Luminous Mobile Robots
by: Nakajima, Keita, et al.
Published: (2024)

Beyond Pairwise Comparisons: Unveiling Structural Landscape of Mobile Robot Models
by: Naito, Shota, et al.
Published: (2025)

Self-Stabilizing Weakly Byzantine Perpetual Gathering of Mobile Agents
by: Hirose, Jion, et al.
Published: (2025)

Tight Bounds on Channel Reliability via Generalized Quorum Systems (Extended Version)
by: Naser-Pastoriza, Alejandro, et al.
Published: (2025)

Simulating Chirality: Solving Distance-$k$-Dispersion on an 1-Interval Connected Ring
by: Mondal, Brati, et al.
Published: (2025)

Practical Byzantine Reliable Broadcast on Partially Connected Networks (Extended version)
by: Bonomi, Silvia, et al.
Published: (2021)

An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model
by: El-Hayek, Antoine, et al.
Published: (2025)

Path Connected Dynamic Graphs with a Study of Dispersion and Exploration
by: Saxena, Ashish, et al.
Published: (2025)

Tight Communication Bounds for Distributed Algorithms in the Quantum Routing Model
by: Dufoulon, Fabien, et al.
Published: (2026)

A Proposal for High-Level Architectural Model Capable of Expressing Various Data Collaboration Platform and Data Space Concepts
by: Dobashi, Masaru, et al.
Published: (2025)

Tight Conditions for Binary-Output Tasks under Crashes
by: Albouy, Timothé, et al.
Published: (2025)

Fairness in Proof of Team Sprint (PoTS): Evaluating Reward Distribution Across Performance Levels
by: Yonezawa, Naoki
Published: (2025)

Robustness of Proof of Team Sprint (PoTS) Against Attacks: A Simulation-Based Analysis
by: Yonezawa, Naoki
Published: (2025)

Empirical Evaluation and Scalability Analysis of Proof of Team Sprint (PoTS): Reward Fairness, Energy Efficiency, and System Stability
by: Yonezawa, Naoki
Published: (2025)

Proof of Team Sprint: A Collaborative Consensus Algorithm for Reducing Energy Consumption in Blockchain Systems
by: Yonezawa, Naoki
Published: (2024)

Optimal Checkpoint Interval with Availability as an Objective Function
by: Saxena, Nirmal Raj, et al.
Published: (2024)

A Nearly Linear-Time Distributed Algorithm for Maximum Cardinality Matching
by: Izumi, Taisuke, et al.
Published: (2023)

Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation
by: Izumi, Taisuke, et al.
Published: (2025)

Holon Streaming: Global Aggregations with Windowed CRDTs
by: Spenger, Jonas, et al.
Published: (2025)