Flipping Matchings is Hard
Abstract
Given a point set P and a plane perfect matching M on P, a flip is an operation that replaces two edges of M such that another plane perfect matching on P is obtained. Given two plane perfect matchings on P, we show that it is NP-hard to minimize the number of flips that are needed to transform one matching into the other.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.