A study of connectivity on dynamic graphs: computing persistent connected components
Crossref DOI link: https://doi.org/10.1007/s10288-022-00507-3
Published Online: 2022-04-19
Published Print: 2023-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Vernet, Mathilde https://orcid.org/0000-0002-9884-5970
Pigné, Yoann
Sanlaville, Éric
Text and Data Mining valid from 2022-04-19
Version of Record valid from 2022-04-19
Article History
Received: 11 February 2021
Revised: 23 November 2021
Accepted: 16 March 2022
First Online: 19 April 2022
Declarations
:
: The authors declare that they have no conflict of interest.