Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons · HackerPapers discussions

Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons — mentioned by payasr

Sat, 19 Oct 2019 09:23:41 GMT

HD is independent of r. And it's not the minimal set of vertices that must be visited.. it is the smallest set of which at least one must be visited. Another good explanation of HD is in section 1.3 of the skeleton dimension paper (https://arxiv.org/pdf/1609.00512.pdf).

Paper and discussion history. A mention is not an endorsement.

Beyond Highway Dimension: Small Distance Labels Using Tree Skeletons — mentioned by payasr

Sat, 19 Oct 2019 09:01:41 GMT

Also, there's some recent work on similar metrics, if you are interested. Do check out (https://arxiv.org/abs/1609.00512) and Sabine Storandt's work on how route planning algorithms behave as graphs scale (https://aaai.org/ocs/index.php/ICAPS/ICAPS18/paper/view/1774...)

Paper and discussion history. A mention is not an endorsement.