Minimum-Complexity Graph Simplification under Fréchet-Like Distances

11/04/2021
by   Omrit Filtser, et al.
0

Simplifying graphs is a very applicable problem in numerous domains, especially in computational geometry. Given a geometric graph and a threshold, the minimum-complexity graph simplification asks for computing an alternative graph of minimum complexity so that the distance between the two graphs remains at most the threshold. In this paper, we propose several NP-hardness and algorithmic results depending on the type of input and simplified graphs, the vertex placement of the simplified graph, and the distance measures between them (graph and traversal distances [1,2]). In general, we show that for arbitrary input and output graphs, the problem is NP-hard under some specific vertex-placement of the simplified graph. When the input and output are trees, and the graph distance is applied from the simplified tree to the input tree, we give an O(kn^5) time algorithm, where k is the number of the leaves of the two trees that are identical and n is the number of vertices of the input.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2018

On Optimal Polyline Simplification using the Hausdorff and Fréchet Distance

We revisit the classical polygonal line simplification problem and study...
research
08/21/2017

On Minimum Bisection and Related Cut Problems in Trees and Tree-Like Graphs

Minimum Bisection denotes the NP-hard problem to partition the vertex se...
research
05/12/2023

Minimum Consistent Subset for Trees Revisited

In a vertex-colored graph G = (V, E), a subset S ⊆ V is said to be consi...
research
11/09/2018

Minimizing and Computing the Inverse Geodesic Length on Trees

The inverse geodesic length (IGL) of a graph G=(V,E) is the sum of inver...
research
12/21/2018

Distance Measures for Embedded Graphs

We introduce new distance measures for comparing embedded graphs based o...
research
03/12/2020

On the Complexity of λ_∞ , Vertex Expansion, and Spread Constant of Trees

Bobkov, Houdré, and the last author introduced a Poincaré-type functiona...
research
03/24/2023

Sharp threshold for embedding balanced spanning trees in random geometric graphs

A rooted tree is balanced if the degree of a vertex depends only on its ...

Please sign up or login with your details

Forgot password? Click here to reset