Path Algorithms on Regular GraphsReport as inadecuate

Path Algorithms on Regular Graphs - Download this document for free, or read online. Document in PDF available to download.

1 LIGM - Laboratoire d-Informatique Gaspard-Monge

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.

Author: Didier Caucal - Trong Hieu Dinh -



Related documents