The Cost of Perfect Matchings in Prism Graphs
摘要
In this paper, we study the ratio between the maximum weight perfect matching and the maximum weight matching. We show that for n-prism graphs this ratio is 1/2, when n is odd and ≤2/3 otherwise. This work is inspired by the use of triangle meshes to model solid objects especially in the conversion of these meshes into quadrangulated meshes.