We consider the following problem: Given a set S of at most n elements f...
Parametric path problems arise independently in diverse domains, ranging...
We construct a family of planar graphs (G_n: n≥ 1), where G_n has n
vert...
It is NP-hard to determine the minimum number of branching
vertices need...
We consider the problem of determining the zero-error list-decoding capa...