Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion
type: Item
instance of: scholarly article
title: Tiling of planar figures without gaps by dominos: graphical foundations of Thurston if algorithm, parallelization uniqueness and decomposion
zbMATH Open document ID: 0887.68111
DOI: 10.1016/0304-3975(95)00204-9
published in: Theoretical Computer Science
publication date: 1997-09-18T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1060150
author: Jean-Claude Fournier
MaRDI profile type: Publication
full work available at URL: 0304-3975(95)00204-9
OpenAlex ID: W1525708409
cites work: Q5615282
cites work: An improved parallel algorithm that computes the BFS numbering of a directed graph
cites work: Conway's Tiling Groups
cites work: Q4228435
Recommended article: Q4850437
Recommended article: An \(O(n \log n)\)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded.
Recommended article: The Tiling Problem Revisited (Extended Abstract)
Recommended article: Q4297418
Recommended article: Algorithms and Computation
Recommended article: Tiling with Squares and Packing Dominos in Polynomial Time
Recommended article: A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino
Recommended article: An Optimal Algorithm for Tiling the Plane with a Translated Polyomino
Recommended article: Domino tilings on planar regions
Recommended article: Tiling problems, automata, and tiling graphs
description: scientific article; zbMATH DE number 1060150