Search: onr:"swepub:oai:DiVA.org:mau-66644" >
Flips in Odd Matchings
Flips in Odd Matchings
-
- Aichholzer, Oswin (author)
- Graz University of Technology
-
- Anna, Brötzner (author)
- Malmö universitet,Institutionen för datavetenskap och medieteknik (DVMT)
-
Perz, Daniel (author)
-
show more...
-
- Schnider, Patrick (author)
- Department of Computer Science, ETH Zürich
-
show less...
-
(creator_code:org_t)
- 2024
- 2024
- English.
-
In: 40th European Workshop on Computational Geometry. ; , s. 447-452
- Related links:
-
https://eurocg2024.m...
-
show more...
-
https://urn.kb.se/re...
-
show less...
Abstract
Subject headings
Close
- Let P be a set of n = 2m + 1 points in the plane in general position. We define the graph GMP whose vertex set is the set of all plane matchings on P with exactly m edges. Two vertices in GMP are connected if the two corresponding matchings have m − 1 edges in common. In this work we show that GMP is connected.
Subject headings
- NATURVETENSKAP -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
- NATURAL SCIENCES -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
- NATURVETENSKAP -- Matematik -- Geometri (hsv//swe)
- NATURAL SCIENCES -- Mathematics -- Geometry (hsv//eng)
Publication and Content Type
- ref (subject category)
- kon (subject category)
To the university's database