Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem - researchr publication

researchr

You are not signed in
Sign in
Sign up

Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia. Polynomial and pseudo-polynomial time algorithms for different classes of the Distance Critical Node Problem. Discrete Applied Mathematics, 253:103-121, 2019. [doi]

Abstract is missing.

runs on WebDSL