Flipping Matchings is Hard
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866915182344667136 |
|---|---|
| author | Binucci, Carla Montecchiani, Fabrizio Perz, Daniel Tappini, Alessandra |
| author_facet | Binucci, Carla Montecchiani, Fabrizio Perz, Daniel Tappini, Alessandra |
| contents | Given a point set $\mathcal{P}$ and a plane perfect matching $\mathcal{M}$ on $\mathcal{P}$, a flip is an operation that replaces two edges of $\mathcal{M}$ such that another plane perfect matching on $\mathcal{P}$ is obtained. Given two plane perfect matchings on $\mathcal{P}$, we show that it is NP-hard to minimize the number of flips that are needed to transform one matching into the other. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_02842 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Flipping Matchings is Hard Binucci, Carla Montecchiani, Fabrizio Perz, Daniel Tappini, Alessandra Computational Geometry Discrete Mathematics Given a point set $\mathcal{P}$ and a plane perfect matching $\mathcal{M}$ on $\mathcal{P}$, a flip is an operation that replaces two edges of $\mathcal{M}$ such that another plane perfect matching on $\mathcal{P}$ is obtained. Given two plane perfect matchings on $\mathcal{P}$, we show that it is NP-hard to minimize the number of flips that are needed to transform one matching into the other. |
| title | Flipping Matchings is Hard |
| topic | Computational Geometry Discrete Mathematics |
| url | https://arxiv.org/abs/2503.02842 |