External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

Bernardetta Addis, Marco Di Summa, Andrea Grosso. Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. Discrete Applied Mathematics, 161(16-17):2349-2360, 2013. [doi]

Abstract

Abstract is missing.

runs on