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.
https://hal-upec-upem.archives-ouvertes.fr/hal-00620155
Contributor : Didier Caucal
<>
Submitted on : Monday, September 30, 2013 - 7:27:38 PM
Last modification on : Friday, July 13, 2018 - 4:00:04 PM
Long-term archiving on: Tuesday, December 31, 2013 - 2:25:25 AM
