Retracting Graphs to Cycles

04/26/2019
by   Samuel Haney, et al.
0

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(mink, sqrtn)-approximation for retracting any graph on n nodes to a cycle with k nodes. We also show a surprising connection to Sperner's Lemma that rules out the possibility of improving this result using natural convex relaxations of the problem. Nevertheless, if the problem is restricted to planar graphs, we show that we can overcome these integrality gaps using an exact 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/24/2018

Planar graphs without pairwise adjacent 3-,4-,5-, and 6-cycle are 4-choosable

Xu and Wu proved that if every 5-cycle of a planar graph G is not simult...
research
08/04/2017

Geometric Embedding of Path and Cycle Graphs in Pseudo-convex Polygons

Given a graph G with n vertices and a set S of n points in the p...
research
06/25/2018

Even Longer Cycles in Essentially 4-Connected Planar Graphs

A planar graph is essentially 4-connected if it is 3-connected and every...
research
08/10/2022

Stable Homology-Based Cycle Centrality Measures for Weighted Graphs

Network centrality measures are concerned with evaluating the importance...
research
10/10/2022

Embedding into Special Classes of Cyclic Graphs and its Applications in VLSI Layout

Graph embedding is the major technique which is used to map guest graph ...
research
06/27/2022

Hardness of almost embedding simplicial complexes in ℝ^d, II

A map f: K →ℝ^d of a simplicial complex is an almost embedding if f(σ) ∩...
research
12/28/2020

Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem

We present the first nontrivial approximation algorithm for the bottlene...

Please sign up or login with your details

Forgot password? Click here to reset