An $$O(n\log n)$$ O ( n log n ) algorithm for finding edge span of cacti
Crossref DOI link: https://doi.org/10.1007/s10878-015-9827-4
Published Online: 2015-01-17
Published Print: 2016-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Janczewski, Robert
Turowski, Krzysztof
License valid from 2015-01-17