First Page | Document Content | |
---|---|---|
Date: 2013-06-03 08:35:50Network theory Combinatorial optimization Routing algorithms Search algorithms Shortest path problem Induced path A* search algorithm Path decomposition Widest path problem Graph theory Mathematics Theoretical computer science | On the Complexity of Finding Spanner PathsAdd to Reading ListSource URL: www.ida.liu.seDownload Document from Source WebsiteFile Size: 273,62 KBShare Document on Facebook |