Searching for a cycle with maximum coverage in undirected graphs
Crossref DOI link: https://doi.org/10.1007/s11590-015-0952-x
Published Online: 2015-11-03
Published Print: 2016-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Grosso, Andrea
Salassa, Fabio
Vancroonenburg, Wim
Text and Data Mining valid from 2015-11-03