12 citations · 48 across the 27 of their papers we have counts for
1 paper · 1 filter
André van Renssen, Shuei Sakaguchi
The problem of locally routing on geometric networks using limited memory is extensively studied in computational geometry. We consider one particular graph, the ordered Θ-graph,…