An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. (Q1401372)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. |
scientific article; zbMATH DE number 1965378
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. |
scientific article; zbMATH DE number 1965378 |
Statements
An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. (English)
0 references
17 August 2003
0 references
tileability
0 references
