Back to Results
First PageMeta Content
Network theory / Routing algorithms / Planar separator theorem / Shortest path problem / Distance / Induced path / Tree / NP-complete problems / Path decomposition / Graph theory / Mathematics / Theoretical computer science


CCCG 2011, Toronto ON, August 10–12, 2011 Memory-Constrained Algorithms for Shortest Path Problems Tetsuo Asano∗ Abstract
Add to Reading List

Document Date: 2011-08-06 04:11:13

Open Document

File Size: 125,16 KB

Share Result on Facebook

City

Informatik / /

Company

Cambridge University Press / /

Country

Germany / Japan / /

/

Facility

square S1 / square S2 / square This / square Sm / Square Si / /

IndustryTerm

shortest path finding algorithm / computing / previous algorithm / sublinear-space algorithm / space-efficient algorithm / basic algorithm / /

Organization

Cambridge University / Max-Planck-Institut f¨ / School of Information / /

Position

vp / /

Technology

previous algorithm / sublinear-space algorithm / 2011 Memory-Constrained Algorithms / same algorithm / shortest path finding algorithm / basic algorithm / 2011 Algorithm / /

SocialTag