"An O(n log n)-algorithm for finding a domino tiling of a plane picture ..."

Nicolas Thiant (2003)

> Home

Details and statistics

DOI: 10.1016/S0304-3975(02)00497-8

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/Thiant03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Thiant03
Nicolas Thiant:
An O(n log n)-algorithm for finding a domino tiling of a plane picture whose number of holes is bounded. Theor. Comput. Sci. 303(2-3): 353-374 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.