355 search results - page 8 / 71 » On Central Spanning Trees of a Graph |
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
COMBINATORICS
2002
13 years 7 months ago
2002
If G = Kn is the complete graph, the classical Pr
JGT
2007
13 years 7 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
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 ...