1986 search results - page 24 / 398 » Path Separability of Graphs |
TKDE
2002
13 years 8 months ago
2002
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
ICRA
2007
IEEE
14 years 3 months ago
2007
IEEE
— Computing optimal paths for mobile robots is an interesting and important problem. This paper presents a method to compute the shortest path for a differential-drive mobile rob...
CPM
2008
Springer
13 years 10 months ago
2008
Springer
Let G be an unweighted and undirected graph of n nodes, and let D be the n
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
In joint work with ´Eva Tardos in 1995, we asked whether it was possible to obtain a polynomial-time, polylogarithmic approximation algorithm for the disjoint paths problem in th...
ICC
2007
IEEE
14 years 16 days ago
2007
IEEE
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...