# Exploring Increasing-Chord Paths and Trees

## TL;DR

This paper investigates the computational complexity of increasing-chord paths and trees in straight-line graph drawings, proving NP-completeness for certain cases and proposing conjectures on related problems.

## Contribution

It establishes NP-completeness for finding increasing-chord spanning trees and conjectures NP-completeness for increasing-chord paths between vertex pairs.

## Key findings

- NP-complete to determine increasing-chord spanning trees
- Proved a reduction from 3-SAT for increasing-chord path problem
- Conjecture that finding such paths is also NP-complete

## Abstract

A straight-line drawing $\Gamma$ of a graph $G=(V,E)$ is a drawing of $G$ in the Euclidean plane, where every vertex in $G$ is mapped to a distinct point, and every edge in $G$ is mapped to a straight line segment between their endpoints. A path $P$ in $\Gamma$ is called increasing-chord if for every four points (not necessarily vertices) $a,b,c,d$ on $P$ in this order, the Euclidean distance between $b,c$ is at most the Euclidean distance between $a,d$. A spanning tree $T$ rooted at some vertex $r$ in $\Gamma$ is called increasing-chord if $T$ contains an increasing-chord path from $r$ to every vertex in $T$. In this paper we prove that given a vertex $r$ in a straight-line drawing $\Gamma$, it is NP-complete to determine whether $\Gamma$ contains an increasing-chord spanning tree rooted at $r$. We conjecture that finding an increasing-chord path between a pair of vertices in $\Gamma$, which is an intriguing open problem posed by Alamdari et al., is also NP-complete, and show a (non-polynomial) reduction from the 3-SAT problem.