✦ LIBER ✦
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth
✍ Scribed by Addis, Bernardetta; Di Summa, Marco; Grosso, Andrea
- Book ID
- 120346269
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 412 KB
- Volume
- 161
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.