The Complexity of Finding Tangles

02/27/2020
by   Oksana Firman, et al.
0

We study the following combinatorial problem. Given a set of n y-monotone curves, which we call wires, a tangle determines the order of the wires on a number of horizontal layers such that the orders of the wires on any two consecutive layers differ only in swaps of neighboring wires. Given a multiset L of swaps (that is, unordered pairs of wires) and an initial order of the wires, a tangle realizes L if each pair of wires changes its order exactly as many times as specified by L. Finding a tangle that realizes a given multiset of swaps and uses the least number of layers is known to be NP-hard. We show that it is even NP-hard to decide if a realizing tangle exists.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/19/2019

Computing Optimal Tangles Faster

We study the following combinatorial problem. Given a set of n y-monoton...
research
05/08/2019

Switches in Eulerian graphs

We show that the graph transformation problem of turning a simple graph ...
research
11/04/2022

Steiner connectivity problems in hypergraphs

We say that a tree T is an S-Steiner tree if S ⊆ V(T) and a hypergraph i...
research
02/27/2018

Finding a root of constrained quadratic polynomial system is NP-hard

Here, we prove that finding a root of a quadratic polynomial system with...
research
07/31/2020

New Results in Sona Drawing: Hardness and TSP Separation

Given a set of point sites, a sona drawing is a single closed curve, dis...
research
11/14/2021

Area-Optimal Simple Polygonalizations: The CG Challenge 2019

We give an overview of theoretical and practical aspects of finding a si...
research
07/30/2020

Approximate Ridesharing of Personal Vehicles Problem

The ridesharing problem is that given a set of trips, each trip consists...

Please sign up or login with your details

Forgot password? Click here to reset