An almost linear time algorithm testing whether the Markoff graph modulo p is connected
Crossref DOI link: https://doi.org/10.1007/s40993-024-00592-9
Published Online: 2024-12-07
Published Print: 2025-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Brown, Colby Austin https://orcid.org/0000-0003-3914-7571
Text and Data Mining valid from 2024-12-07
Version of Record valid from 2024-12-07
Article History
Received: 25 January 2024
Accepted: 9 September 2024
First Online: 7 December 2024