206 search results - page 17 / 42 » Three Hoppy path problems and ternary paths |
EOR
2008
13 years 7 months ago
2008
In Multi-Protocol Label Switching (MPLS) networks, traffic demands can be routed along tunnels called Label Switched Paths (LSPs). A tunnel is characterized by a path in the netwo...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
ICPR
2000
IEEE
13 years 12 months ago
2000
IEEE
This paper introduces a family of ¢ ¢ tensors, referred to as “join tensors” or Jtensors for short, which perform “3D to 3D” alignment between coordinate systems of sets...
CONSTRAINTS
2008
13 years 7 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...