Work

Removing Popular Faces in Curve Arrangements

Year: 2024

Type: article

Abstract: A face in a curve arrangement is called popular if it is bounded by the same curve multiple times. Motivated by the automatic generation of curved nonogram puzzles, we investigate possibilities to eliminate the popular faces in an arrangement by inserting a single additional curve. This turns out to be NP-hard; however, it becomes tractable when the number of popular faces is small: We present a randomized FPT-time algorithm where the parameter is the number of popular faces.

Source: Journal of Graph Algorithms and Applications

DOI: 10.7155/jgaa.v28i2.2988

Authors: Phoebe De Nooijer, Soeren Terziadis, Alexandra Weinberger, Zuzana Masárová, Tamara Mchedlidze, Maarten Löffler, Günter Rote

Institutions: Utrecht University, Eindhoven University of Technology, FernUniversität in Hagen, Institute of Science and Technology Austria, Freie Universität Berlin

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4404012609

FWCI: 0.197

Cites:

Cited by: 1

Related to: 10