Article ID Journal Published Year Pages File Type
6871081 Discrete Applied Mathematics 2018 19 Pages PDF
Abstract
Moreover, there is an absolute constant c>0 such that there is no 2cn-time algorithm deciding the Distance Edge Labeling problem unless the exponential time hypothesis fails.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Computational complexity of distance edge labeling
Authors
, ,