Path Algorithms on Regular Graphs

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.

• Type: Conference
• Year: 2007
• Where: FCT
• Authors: Didier Caucal, Dinh Trong Hieu
• Keywords: Deterministic Graph Grammars, FCT 2007, Shortest Path Algorithms, finite Graph Theory