1545 search results - page 296 / 309 » On tree congestion of graphs |
116
click to vote
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
CIKM
2007
Springer
15 years 3 months ago
2007
Springer
Visualizing network data, from tree structures to arbitrarily connected graphs, is a difficult problem in information visualization. A large part of the problem is that in network...
IWCMC
2006
ACM
15 years 3 months ago
2006
ACM
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
For a weighted, undirected graph G = V;E where jVj = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths APSP....
109
click to vote
DIALM
2005
ACM
14 years 11 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...