Path connected dynamic graphs with a study of dispersion and exploration

In dynamic graphs, several edges may get added or deleted in a round. There are different connectivity models based on the constraints on the addition/deletion of edges. One such model is the T-Interval Connectivity model, where edges can be added/deleted, keeping the graph nodes connected in each s...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1050; S. 115390
Hauptverfasser:	Saxena, Ashish, Mondal, Kaushik
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 27.09.2025
Schlagworte:	Deterministic algorithm Dispersion Dynamic graphs Exploration Mobile agents Dynamic graphs Exploration Deterministic algorithm Mobile agents Dispersion
ISSN:	0304-3975
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!