activity
20172020
most citedAn O(n) time algorithm for finding Hamilton cycles with high probability

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

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.DS2017

Nearest Common Ancestors: Universal Trees and Improved Labeling Schemes

Fabian Kuhn, Konstantinos Panagiotou, Pascal Su

We investigate the nearest common ancestor (NCA) function in rooted trees. As the main conceptual contribution, the paper introduces universal trees for the NCA function: For a giv…