200 search results - page 14 / 40 » ipl 2006 |
IPL
2000
14 years 9 months ago
2000
Recently a new family of Cayley graphs of fixed even node degree called the Cyclic-cubes were proposed as interconnection networks by Fu and Chau (1998). We show that these networ...
IPL
2002
14 years 9 months ago
2002
It is shown that for any class C closed under linear-time reductions, the complete sets for C under sublogarithmic reductions are also complete under 2DFA reductions, and thus are...
IPL
2002
14 years 9 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
IPL
2002
14 years 9 months ago
2002
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
IPL
2002
14 years 9 months ago
2002
Constructing maximum bandwidth paths has been a basic operation in the study of network routing, in particular in the recent study of network QoS routing. In the literature, it ha...