"On the Complexity of the (Approximate) Nearest Colored Node Problem."

Maximilian Probst (2018)
a service of Schloss Dagstuhl - Leibniz Center for Informatics