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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

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

File

algo.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Didier Caucal, Trong Hieu Dinh. Path Algorithms on Regular Graphs. FCT'07, Aug 2007, Budapest, Hungary. pp.199-212, ⟨10.1007/978-3-540-74240-1_18⟩. ⟨hal-00620155⟩

Share

Metrics

Record views

238

Files downloads

210