Browsing LCS Technical Memos (1974 - 2003) by Author "Snyder, Larry"
Now showing items 1-1 of 1
-
Generalized Planar Matching
Berman, Fran; Leighton, Tom; Shor, Peter; Snyder, Larry (1985-04)In this paper, we prove that maximum planar H-matching (the problem of determining the maximum number of node-disjointed copies of the fixed graph H contained in a variable planar graph G) is NP-complete for any connected ...