AI Chat AI Image Generator AI Video Text to Speech

Link Crossing Number is NP-hard

08/12/2019

∙

by Arnaud de Mesmay, et al.

∙

∙

We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.

Arnaud de Mesmay
16 publications
Marcus Schaefer
6 publications
Eric Sedgwick
3 publications

page 1

page 2

page 3

page 4

research

∙ 03/13/2019

2-CLUB is NP-hard for distance to 2-club cluster graphs

We show that 2-CLUB is NP-hard for distance to 2-club cluster graphs....

0 Mithilesh Kumar, et al. ∙

research

∙ 06/27/2023

A Note on the Complexity of One-Sided Crossing Minimization of Trees

In 2011, Harrigan and Healy published a polynomial-time algorithm for on...

0 Alexander Dobler, et al. ∙

research

∙ 12/11/2019

Crossing Reduction of Sankey Diagram with Barycentre Ordering via Markov Chain

Sankey diagram is popular for analyzing primary flows in network data. H...

0 Hechen Li, et al. ∙

research

∙ 05/01/2022

Voting in Two-Crossing Elections

We introduce two-crossing elections as a generalization of single-crossi...

0 Andrei Constantinescu, et al. ∙

research

∙ 08/25/2017

Embeddability in R^3 is NP-hard

We prove that the problem of deciding whether a 2- or 3-dimensional simp...

0 Arnaud de Mesmay, et al. ∙

research

∙ 06/23/2019

Single-crossing Implementation

An election over a finite set of candidates is called single-crossing if...

0 Nathann Cohenn, et al. ∙

research

∙ 08/27/2018

Fair redistricting is hard

Gerrymandering is a long-standing issue within the U.S. political system...

0 Richard Kueng, et al. ∙