AI Chat AI Image Generator AI Video Text to Speech

Yin-Yang Puzzles are NP-complete

06/29/2021

∙

by Erik D. Demaine, et al.

∙

∙

We prove NP-completeness of Yin-Yang / Shiromaru-Kuromaru pencil-and-paper puzzles. Viewed as a graph partitioning problem, we prove NP-completeness of partitioning a rectangular grid graph into two induced trees (normal Yin-Yang), or into two induced connected subgraphs (Yin-Yang without 2 × 2 rule), subject to some vertices being pre-assigned to a specific tree/subgraph.

Erik D. Demaine
75 publications
Jayson Lynch
42 publications
Mikhail Rudoy
12 publications
Yushi Uno
8 publications

page 3

page 5

page 6

page 7

page 8

research

∙ 02/28/2022

Cutting a tree with Subgraph Complementation is hard, except for some small trees

For a property Π, Subgraph Complementation to Π is the problem to find w...

0 Dhanyamol Antony, et al. ∙

research

∙ 02/23/2022

Induced Disjoint Paths and Connected Subgraphs for H-Free Graphs

Paths P_1,…, P_k in a graph G=(V,E) are mutually induced if any two dist...

0 Barnaby Martin, et al. ∙

research

∙ 03/17/2020

NP-completeness Results for Graph Burning on Geometric Graphs

Graph burning runs on discrete time steps. The aim of the graph burning ...

0 Arya Tanmay Gupta, et al. ∙

research

∙ 09/30/2021

Rectangular Spiral Galaxies are Still Hard

Spiral Galaxies is a pencil-and-paper puzzle played on a grid of unit sq...

0 Erik D. Demaine, et al. ∙

research

∙ 07/11/2012

On finding minimal w-cutset

The complexity of a reasoning task over a graphical model is tied to the...

0 Bozhena Bidyuk, et al. ∙

research

∙ 01/14/2020

NP-completeness of slope-constrained drawing of complete graphs

We prove the NP-completeness of the following problem. Given a set S of ...

0 Cédric Pilatte, et al. ∙

research

∙ 06/04/2019

Shellings from relative shellings, with an application to NP-completeness

Shellings of simplicial complexes have long been a useful tool in topolo...

0 Andrés Santamaría-Galvis, et al. ∙