57 search results - page 4 / 12 » Minimum Depth Graph Embedding |
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
ICALP
1992
Springer
13 years 9 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
AINA
2007
IEEE
14 years 3 days ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
DM
1998
13 years 5 months ago
1998
An embedding of Kn into a hypercube is a mapping of the n vertices of Kn to distinct vertices of the hypercube, and the associated cost is the sum over all pairs of (mapped) verti...
COMBINATORICS
1999
13 years 5 months ago
1999
It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...