A heuristic approach for dividing graphs into bi-connected components with a size constraint
Crossref DOI link: https://doi.org/10.1007/s10732-017-9331-3
Published Online: 2017-04-19
Published Print: 2017-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Jovanovic, Raka
Nishi, Tatsushi
Voß, Stefan
License valid from 2017-04-19