514 search results - page 52 / 103 » Drawing a Graph in a Hypercube |
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Greedy Routing is a class of routing algorithms in which the packets are forwarded in a manner that reduces the distance to the destination at every step. In an attempt to provide...
SMA
2008
ACM
14 years 8 months ago
2008
ACM
View identification is the basal process for solid reconstruction from engineering drawings. A new method is presented to label various views from a section-involved drawing and i...
116
click to vote
COMGEO
2011
ACM
14 years 4 months ago
2011
ACM
A set of planar graphs share a simultaneous embedding if they can be drawn on the same vertex set V in the Euclidean plane without crossings between edges of the same graph. Fixed ...
70
Voted
GD
2006
Springer
15 years 1 months ago
2006
Springer
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
ESA
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. The depth of a planar embedding is a measure of the topological nesting of the biconnected components of the graph. Minimizing the depth of planar embeddings has importan...