Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Identifying critical nodes in undirected graphs: Complexity results and ..."

Bernardetta Addis, Marco Di Summa, Andrea Grosso (2013)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2013.03.021

access: open

type: Journal Article

metadata version: 2023-09-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/AddisSG13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/AddisSG13
Bernardetta Addis, Marco Di Summa, Andrea Grosso:
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. Discret. Appl. Math. 161(16-17): 2349-2360 (2013)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.