1![SHORTEST PATHS IN THE TOWER OF HANOI GRAPH AND FINITE AUTOMATA DAN ROMIK Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computin SHORTEST PATHS IN THE TOWER OF HANOI GRAPH AND FINITE AUTOMATA DAN ROMIK Abstract. We present efficient algorithms for constructing a shortest path between two configurations in the Tower of Hanoi graph, and for computin](https://www.pdfsearch.io/img/20d1c1839b694a3afcd791bdf6335f45.jpg) | Add to Reading ListSource URL: www.math.ucdavis.edu- Date: 2014-02-10 20:43:55
|
---|
2![Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada Induced paths of given parity in planar graphs Naomi Nishimura University of Waterloo Canada](https://www.pdfsearch.io/img/14840e0c6c9e5408e453ab38b0e8e6d5.jpg) | Add to Reading ListSource URL: rutcor.rutgers.eduLanguage: English - Date: 2012-01-04 04:27:26
|
---|
3![CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016 CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016](https://www.pdfsearch.io/img/2b639b1f9ca9485cf766f86f049098d6.jpg) | Add to Reading ListSource URL: theory.stanford.eduLanguage: English - Date: 2016-01-22 08:04:42
|
---|
4![The Graph BLAS effort and its implications for Exascale David
Bader
(GA
Tech),
Aydın
Buluç
(LBNL), John
Gilbert
(UCSB),
Joseph
Gonzalez
(UCB),
Jeremy
Kepner
(MIT The Graph BLAS effort and its implications for Exascale David
Bader
(GA
Tech),
Aydın
Buluç
(LBNL), John
Gilbert
(UCSB),
Joseph
Gonzalez
(UCB),
Jeremy
Kepner
(MIT](https://www.pdfsearch.io/img/e5550846436c531f56d92556699544e1.jpg) | Add to Reading ListSource URL: gauss.cs.ucsb.eduLanguage: English - Date: 2014-07-07 13:02:44
|
---|
5![155 Documenta Math. On the History of the Shortest Path Problem Alexander Schrijver 155 Documenta Math. On the History of the Shortest Path Problem Alexander Schrijver](https://www.pdfsearch.io/img/d35c245c380397ff7640652afefe5a1a.jpg) | Add to Reading ListSource URL: www.math.uiuc.eduLanguage: English - Date: 2012-07-25 10:24:53
|
---|
6![LNCSEfficient Dynamic Aggregation LNCSEfficient Dynamic Aggregation](https://www.pdfsearch.io/img/c0da2af005ea7cf089359c8f0fcad4f4.jpg) | Add to Reading ListSource URL: webee.technion.ac.ilLanguage: English - Date: 2007-05-14 09:17:03
|
---|
7![Microsoft Worddoc Microsoft Worddoc](https://www.pdfsearch.io/img/a26cdaad006cc9d5e72ee6dfc9c541a1.jpg) | Add to Reading ListSource URL: publik.tuwien.ac.atLanguage: English - Date: 2008-08-01 06:21:03
|
---|
8![Weighted Synergy Graphs for Effective Team Formation with Heterogeneous Ad Hoc Agents Somchaya Liemhetcharat∗ and Manuela Veloso School of Computer Science, Carnegie Mellon University Pittsburgh, PA 15213, USA som@ri.c Weighted Synergy Graphs for Effective Team Formation with Heterogeneous Ad Hoc Agents Somchaya Liemhetcharat∗ and Manuela Veloso School of Computer Science, Carnegie Mellon University Pittsburgh, PA 15213, USA som@ri.c](https://www.pdfsearch.io/img/7c19d0eb6760102930903dd351955029.jpg) | Add to Reading ListSource URL: somchaya.orgLanguage: English - Date: 2014-05-05 11:44:38
|
---|
9![How to apply de Bruijn graphs to genome assembly How to apply de Bruijn graphs to genome assembly](https://www.pdfsearch.io/img/3a0a694706b010080e18880106bf0974.jpg) | Add to Reading ListSource URL: www.nature.comLanguage: English - Date: 2012-01-20 11:24:28
|
---|
10![Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗ arXiv:1108.4675v1 [cs.SI] 23 Aug 2011 Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗ arXiv:1108.4675v1 [cs.SI] 23 Aug 2011](https://www.pdfsearch.io/img/6fa579a39f0448e57cc7a3aa2e70604e.jpg) | Add to Reading ListSource URL: www.dcg.ethz.chLanguage: English - Date: 2014-09-26 08:28:56
|
---|