704 search results - page 29 / 141 » Isometrically Embedded Graphs |
CODES
2010
IEEE
13 years 5 months ago
2010
IEEE
The last years have shown that there is no way to disregard the advantages provided by multiprocessor System-on-Chip (MPSoC) architectures in the embedded systems domain. Using mu...
COMBINATORICS
2002
13 years 7 months ago
2002
Suppose G is r-colorable and P V (G) is such that the components of G[P] are far apart. We show that any (r + s)-coloring of G[P] in which each component is s-colored extends to ...
FOCS
1995
IEEE
13 years 11 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...