DeepAI AI Chat
Log In Sign Up

Tromino Tilings with Pegs via Flow Networks

by   Javier T. Akagi, et al.
Universidad Nacional de Asunción

A tromino tiling problem is a packing puzzle where we are given a region of connected lattice squares and we want to decide whether there exists a tiling of the region using trominoes with the shape of an L. In this work we study a slight variation of the tromino tiling problem where some positions of the region have pegs and each tromino comes with a hole that can only be placed on top of the pegs. We present a characterization of this tiling problem with pegs using flow networks and show that (i) there exists a linear-time parsimonious reduction to the maximum-flow problem, and (ii) counting the number of such tilings can be done in linear-time. The proofs of both results contain algorithms that can then be used to decide the tiling of a region with pegs in O(n) time.


page 1

page 2

page 3

page 4


Conformal mapping in linear time

Given any ϵ >0 and any planar region Ω bounded by a simple n-gon P we co...

A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks

We present an alternative and simpler method for computing principal typ...

A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks

We pull together previously established graph-theoretical results to pro...

A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs

Counting the number of homomorphisms of a pattern graph H in a large inp...

On Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

We present a quasilinear time algorithm to decide the word problem on a ...

An Optimal Algorithm to Compute the Inverse Beacon Attraction Region

The beacon model is a recent paradigm for guiding the trajectory of mess...

Flows in Almost Linear Time via Adaptive Preconditioning

We present algorithms for solving a large class of flow and regression p...