2354 search results - page 390 / 471 » Radio number for trees |
155
click to vote
GD
2007
Springer
16 years 13 days ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
161
click to vote
ICCBR
2007
Springer
16 years 13 days ago
2007
Springer
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue,...
151
click to vote
FOCS
2006
IEEE
16 years 10 days ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
152
click to vote
ICDE
2006
IEEE
16 years 10 days ago
2006
IEEE
It is important to process the updates when nodes are inserted into or deleted from the XML tree. All the existing labeling schemes have high update cost, thus in this paper we pr...
143
click to vote
ICDE
2006
IEEE
16 years 10 days ago
2006
IEEE
XPORT (eXtensible Profile-driven Overlay Routing Trees) is a generic data dissemination system that supports an extensible set of data types and profiles, and an optimization fr...