Login / Signup

Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth.

Bernardetta AddisMarco Di SummaAndrea Grosso
Published in: Discret. Appl. Math. (2013)
Keyphrases