1545 search results - page 18 / 309 » On tree congestion of graphs |
196
click to vote
IEICET
2011
15 years 1 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
158
click to vote
NIPS
2008
15 years 7 months ago
2008
Given an n-vertex weighted tree with structural diameter S and a subset of m vertices, we present a technique to compute a corresponding m
203
click to vote
FOCS
2004
IEEE
15 years 9 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
145
click to vote
DAM
2002
15 years 5 months ago
2002
We establish results on NeST graphs (intersection tolerance graphs of neighborhood subtrees of a tree) and several subclasses. In particular, we show the equivalence of proper NeS...