activity
20132026
most citedl-path vertex cover is easier than l-hitting set for small l

2 citations · 8 across the 13 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.DS2016

Succinct data-structure for nearest colored node in a tree

Dekel Tsur

We give a succinct data-structure that stores a tree with colors on the nodes. Given a node x and a color alpha, the structure finds the nearest node to x with color alpha. This re…