Declawing a graph: polyhedra and Branch-and-Cut algorithms
Crossref DOI link: https://doi.org/10.1007/s10878-021-00736-y
Published Online: 2021-04-19
Published Print: 2021-07
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Fragoso, Felipe C.
de Sousa Filho, Gilberto F. http://orcid.org/0000-0002-6959-712X
Protti, Fábio
Text and Data Mining valid from 2021-04-19
Version of Record valid from 2021-04-19
Article History
Accepted: 7 April 2021
First Online: 19 April 2021