| Document Date: 2013-08-11 21:51:56
Open Document File Size: 343,33 KBShare Result on Facebook
City Waterloo / / Company Cactus Networks / Vertex / / Facility Carleton University / Computing Science-Simon Fraser University / We store / / IndustryTerm linear time algorithms / unicyclic network / cycle network / connected networks / uni-cyclic networks / arbitrary networks / online version / linear time algorithm / binary search / maximal connected sub-network / connected sub-networks / tree network / tree networks / linear algorithm / modified breadth-first-search / uni-cyclic network / linear-time algorithm / query algorithms / unicyclic networks / breadth-first-search / / Organization Carleton University / Institut f¨ / Simon Fraser University / / Person Anil Maheshwari / / ProvinceOrState Ontario / / PublishedMedium Communications of the ACM / / Technology linear algorithm / linear time algorithms / linear time algorithm / query algorithms / Simulation / linear-time algorithm / /
SocialTag |
CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Optimal Data Structures for Farthest-Point Queries in Cactus Networks∗ Prosenjit Bose† Jean-Lou De Carufel†