12 citations · 14 across the 3 of their papers we have counts for
3 papers
cs.DS2019
Listing Conflicting Triples in Optimal Time
Mathias Weller
Different sources of information might tell different stories about the evolutionary history of a given set of species. This leads to (rooted) phylogenetic trees that "disagree" on…
cs.DS2015★ 12 cited
On the Complexity of Hub Labeling
Maxim Babenko, Andrew V. Goldberg, Haim Kaplan +2
Hub Labeling (HL) is a data structure for distance oracles. Hierarchical HL (HHL) is a special type of HL, that received a lot of attention from a practical point of view. However,…
cs.CC2014★ 2 cited
Optimal Hub Labeling is NP-complete
Mathias Weller
Distance labeling is a preprocessing technique introduced by Peleg [Journal of Graph Theory, 33(3)] to speed up distance queries in large networks. Herein, each vertex receives a (…