Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

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

Authors:	Bernardetta Addis Marco Di Summa Andrea Grosso

Affiliation:	1. Dipartimento di Informatica, Università degli Studi di Torino, Italy;2. Dipartimento di Matematica, Università degli Studi di Padova, Italy

Abstract:

Keywords:	Critical node problem Treewidth Complexity Dynamic programming
本文献已被 ScienceDirect 等数据库收录！