| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6871074 | Discrete Applied Mathematics | 2018 | 10 Pages |
Abstract
It is shown that it is NP-hard to determine any of the following for a given graph: the online independence number, the online vertex cover number, and the online domination number.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Joan Boyar, Christian Kudahl,