First Page | Document Content | |
---|---|---|
Date: 2011-08-06 04:11:13Network 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∗ AbstractAdd to Reading ListSource URL: www.cccg.caDownload Document from Source WebsiteFile Size: 125,16 KBShare Document on Facebook |