1545 search results - page 18 / 309 » On tree congestion of graphs |
RSA
2006
14 years 9 months ago
2006
Consider the random graph model of Barab
109
click to vote
IEICET
2011
14 years 4 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...
75
Voted
NIPS
2008
14 years 11 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
113
click to vote
FOCS
2004
IEEE
15 years 1 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 ...
DAM
2002
14 years 9 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...