2354 search results - page 111 / 471 » Radio number for trees |
151
click to vote
APPROX
2000
Springer
15 years 10 months ago
2000
Springer
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on ...
176
click to vote
SIBGRAPI
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper describes a real-time shadow generation algorithm for polygonal environments illuminated by movable point light sources. The main goal is to quickly reduce the number o...
163
click to vote
SIROCCO
2004
15 years 7 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...
160
click to vote
LICS
2002
IEEE
15 years 11 months ago
2002
IEEE
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widesprea...
168
click to vote
SRDS
1998
IEEE
15 years 10 months ago
1998
IEEE
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...