|
| << 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 13 of 19 found articles
| Title: |
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion |
| Author: |
Mishra, Sounaka Pananjady, Ashwin Safina Devi, N. |
| Appeared in: |
Journal of discrete algorithms |
| Paging: | Volume 33 (2015) nr. C pages 10 p. |
| Year: |
2015 |
| Contents: | |
| Publisher: |
Elsevier B.V. |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 13 of 19 found articles
| << previous | next >> |