182 search results - page 5 / 37 » Routing Tree Problems on Random Graphs |
SIAMDM
2010
13 years 2 months ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
TCAD
2008
13 years 7 months ago
2008
Given a set of pins and a set of obstacles on routing layers, a multilayer obstacle-avoiding rectilinear Steiner minimal tree (ML-OARSMT) connects these pins by rectilinear edges w...
SWAT
2004
Springer
14 years 23 days ago
2004
Springer
In this paper we introduce a new notion of collective tree spanners. We say that a graph G = (V, E) admits a system of µ collective additive tree r-spanners if there is a system T...
DAM
2008
13 years 7 months ago
2008
We study a variant of the pickup-and-delivery problem (PDP) in which the objects that have to be transported can be reloaded at most d times, for a given d N. This problem is kno...
COLOGNETWENTE
2009
13 years 8 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...