Path Algorithms on Regular Graphs
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...