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

Bernardetta Addis, Marco Di Summa, Andrea Grosso

Source record

Source: Crossref

Published: Nov 1, 2013

DOI: 10.1016/j.dam.2013.03.021

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.