1,970 research outputs found
Retracting Graphs to Cycles
We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices so as to minimize the maximum stretch of any edge, subject to the constraint that the restriction of the mapping to the cycle is the identity map. This problem has its roots in the rich theory of retraction of topological spaces, and has strong ties to well-studied metric embedding problems such as minimum bandwidth and 0-extension. Our first result is an O(min{k, sqrt{n}})-approximation for retracting any graph on n nodes to a cycle with k nodes. We also show a surprising connection to Sperner\u27s Lemma that rules out the possibility of improving this result using certain natural convex relaxations of the problem. Nevertheless, if the problem is restricted to planar graphs, we show that we can overcome these integrality gaps by giving an optimal combinatorial algorithm, which is the technical centerpiece of the paper. Building on our planar graph algorithm, we also obtain a constant-factor approximation algorithm for retraction of points in the Euclidean plane to a uniform cycle
Traversing Every Edge in Each Direction Once, But Not at Once: Cubic (Polyhedral) Graphs
A {\em retracting-free bidirectional circuit} in a graph is a closed walk which traverses every edge exactly once in each direction and such that no edge is succeeded by the same edge in the opposite direction. Such a circuit revisits each vertex only in a number of steps. Studying the class of all graphs admitting at least one retracting-free bidirectional circuit was proposed by Ore (1951) and is by now of practical use to nanotechnology. The latter needs in various molecular polyhedra that are constructed from a single chain molecule in the retracting-free way. Some earlier results for simple graphs, obtained by Thomassen and, then, by other authors, are specially refined by us for a cubic graph . Most of such refinements depend only on the number of vertices of
The boundary coefficient : a vertex measure for visualizing and finding structure in weighted graphs
Large-diameter astromast development
The 15-m-long by 0.75-diameter deployable supermast was delivered. The performance characteristics, design parameters, and developmental work associated with this mast are described. The main differences, besides the length of these two mast sections, are a change in the longeron material (the principal structural member) to a circular cross section and the incorporation of a lanyard-bridle system which makes unaided deployment and retraction possible in zero gravity
Relatchable launch restraint mechanism for deployable booms
A new Relatchable Launch Mechanism was developed which enables a deployable system to be restrained and released repeatedly rather than the normal one shot release systems of the past. The deployable systems are of the self extending type which rely on a lanyard attached to a drive motor to control the deployment and retraction. The Relatch Mechanism uses the existing drive motor to also actuate the latch. The design and kinematics of the Relatch Mechanism as used on two flight programs are described
A node-capacitated Okamura-Seymour theorem
The classical Okamura-Seymour theorem states that for an edge-capacitated,
multi-commodity flow instance in which all terminals lie on a single face of a
planar graph, there exists a feasible concurrent flow if and only if the cut
conditions are satisfied. Simple examples show that a similar theorem is
impossible in the node-capacitated setting. Nevertheless, we prove that an
approximate flow/cut theorem does hold: For some universal c > 0, if the node
cut conditions are satisfied, then one can simultaneously route a c-fraction of
all the demands. This answers an open question of Chekuri and Kawarabayashi.
More generally, we show that this holds in the setting of multi-commodity
polymatroid networks introduced by Chekuri, et. al. Our approach employs a new
type of random metric embedding in order to round the convex programs
corresponding to these more general flow problems.Comment: 30 pages, 5 figure
- …