Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-74240-1_18 | FCT |
Keywords | Field | DocType |
instance shortest path algorithm,regular graph,standard algorithm,deterministic graph grammar,general method,finite graph theory,shortest path algorithm,graph theory | Discrete mathematics,Block graph,Combinatorics,Strongly regular graph,Line graph,Graph property,Computer science,Algorithm,Distance-hereditary graph,Symmetric graph,Lattice graph,Universal graph | Conference |
Volume | ISSN | ISBN |
4639 | 0302-9743 | 3-540-74239-5 |
Citations | PageRank | References |
1 | 0.44 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Didier Caucal | 1 | 470 | 39.15 |
| Dinh Trong Hieu | 2 | 1 | 0.44 |