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...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1050; p. 115390
Main Authors:	Saxena, Ashish, Mondal, Kaushik
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 27.09.2025
Subjects:	Deterministic algorithm Dispersion Dynamic graphs Exploration Mobile agents Dynamic graphs Exploration Deterministic algorithm Mobile agents Dispersion
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!