ARTICLE
|
doi:10.20944/preprints201805.0012.v1
Subject:
Computer Science And Mathematics,
Computer Vision And Graphics
Keywords:
NP-complete; graph theory; layered graph; polynomial time; quasi-polynomial time; dynamic programming; independent set; vertex cover; dominating set
Online: 2 May 2018 (05:41:54 CEST)