An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...