A linear algorithm for a perfect matching in polyomino graphs

descriptionPublicationkeyboard_double_arrow_right Article 01 May 2017 Australia English Publisher:Elsevier BVJournal:Theoretical Computer Science, volume 675, pages 82-88 (issn: 0304-3975,

Copyright policy )

Authors: Yuqing Lin; Fuji Zhang;

doi: 10.1016/j.tcs.2017.02.028

handle: 1959.13/1400017

A linear algorithm for a perfect matching in polyomino graphs

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Country

Australia

Related Organizations

University of Newcastle Australia
Australia
Xiamen University
China (People's Republic of)

Keywords

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Graph algorithms (graph-theoretic aspects), polyomino graphs, perfect matching, Polyominoes, linear algorithm

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	2
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average