<--- Back to Details
| 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 |
Add to Reading List |
On the Complexity of Finding Spanner Paths | Finding an induced path of given parity in planar graphs in polynomial time Marcin Kami´nski ∗ Naomi Nishimura†DocID: 1s12G - View Document |
| Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo CanadaDocID: 1rsEH - View Document |
| Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam PayvarDocID: 1g2wf - View Document |
| Randomized Algorithms 2015A Lecture 5 – Edge Sparsification for Cuts∗ Robert Krauthgamer 1DocID: 1aFtk - View Document |
| OntoNav: A Semantic Indoor Navigation SystemDocID: 1aA1B - View Document |