Dynamic Path Queries in Linear Space
Sign Up to like & getrecommendations! Published in 2018 at "Algorithmica"
DOI: 10.1007/s00453-018-0413-x
Abstract: In the path reporting problem, we preprocess a tree on n nodes each of which is assigned a weight, such that given an arbitrary path and a weight range, we can report the nodes whose… read more here.
Keywords: range; time; linear space; lgn lglgn ... See more keywords