 |
HAL UPEC - UPEM Portal |  |
 |
Conference papers
Path Algorithms on Regular Graphs
Abstract : We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infinite graphs generated by deterministic graph grammars.
Cited literature [7 references]
https://hal-upec-upem.archives-ouvertes.fr/hal-00620155
Contributor : Didier Caucal Connect in order to contact the contributor
Submitted on : Monday, September 30, 2013 - 7:27:38 PM
Last modification on : Saturday, January 15, 2022 - 3:58:07 AM
Long-term archiving on: : Tuesday, December 31, 2013 - 2:25:25 AM
Contributor : Didier Caucal Connect in order to contact the contributor
Submitted on : Monday, September 30, 2013 - 7:27:38 PM
Last modification on : Saturday, January 15, 2022 - 3:58:07 AM
Long-term archiving on: : Tuesday, December 31, 2013 - 2:25:25 AM
File
algo.pdf
Files produced by the author(s)