Three Hoppy path problems and ternary paths

15 years 3 months ago

Download math.haifa.ac.il

In this paper we solve several recurrence relations with two (three) indices using combinatorial methods. Moreover, we present several recurrence relations with two (three) indices related to ternary paths and k-ary paths.

Eva Yu-Ping Deng, Toufik Mansour

Real-time Traffic

Combinatorial Methods | DAM 2008 | Paper | Recurrence Relations |

claim paper

» New results on shortest paths in three dimensions

» The path partition problem and related problems in bipartite graphs

» PathExpander Architectural Support for Increasing the Path Coverage of Dynamic Bug Detecti...

» Advances in QoS paths selection problem

» Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

» Shortest paths between shortest paths and independent sets

» Timevarying path following control for portHamiltonian systems

» Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	DAM
Authors	Eva Yu-Ping Deng, Toufik Mansour

Comments (0)

Sciweavers

Three Hoppy path problems and ternary paths

Combinatorial Methods | DAM 2008 | Paper | Recurrence Relations |

Explore & Download

Productivity Tools

Sciweavers