|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 29 of 67 found articles
| Title: |
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth |
| Author: |
Addis, Bernardetta Di Summa, Marco Grosso, Andrea |
| Appeared in: |
Discrete applied mathematics |
| Paging: | Volume 161 (2013) nr. 16-17 pages 12 p. |
| Year: |
2013 |
| Contents: | |
| Publisher: |
Elsevier B.V. |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 29 of 67 found articles
| << previous | next >> |