Theoretical Computer ScienceVolume 675, 2 May 2017, Pages 82-88A linear algorithm for a perfect matching in polyomino graphsAuthor links open overlay panelYuqing Lin a, Fuji Zhang bShow moreShareCitehttps://doi.org/10.1016/j.tcs.2017.02.028Get rights and contentUnder an Elsevier user licenseopen archiveAbstractIn this paper, we present a linear algorithm to find a perfect matching in a polyomino graph or show that there are none.Previous article in issueNext article in issueKeywordsLinear algorithmPolyomino graphsPerfect matchingRecommended articlesCited by (0)© 2017 Elsevier B.V.
