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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
APA
Caucal, D., & Hieu, D. T. (2007). Path algorithms on regular graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4639 LNCS, pp. 199–212). Springer Verlag. https://doi.org/10.1007/978-3-540-74240-1_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free