1986 search results - page 109 / 398 » Path Separability of Graphs |
AAIM
2008
Springer
13 years 10 months ago
2008
Springer
We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
CCCG
2008
13 years 10 months ago
2008
Let G be a graph embedded in the L1-plane. The stretch factor of G is the maximum over all pairs of distinct vertices p and q of G of the ratio LG 1 (p, q)/L1(p, q), where LG 1 (p...
JCSS
1998
13 years 8 months ago
1998
d Abstract) LYDIA E. KAVRAKI JEAN-CLAUDE LATOMBE RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
JDCTA
2010
13 years 3 months ago
2010
At present, China's automobile logistics cost accounts for more than 20% of the production of motor vehicles. Therefore, lowering logistics cost by seeking its best path is a...
TON
2012
11 years 11 months ago
2012
Abstract—Wireless networks (including wireless mesh networks) provide opportunities for using multiple paths. Multihoming of hosts, possibly using different technologies and prov...