Fixed-parameter algorithms for graph constraint logic

Non-deterministic constraint logic (NCL) is a simple model of computation based on orientations of a constraint graph with edge weights and vertex demands. NCL captures PSPACE and has been a useful tool for proving algorithmic hardness of many puzzles, games, and reconfiguration problems. In particu...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 959; p. 113863
Main Authors:	Hatanaka, Tatsuhiko, Hommelsheim, Felix, Ito, Takehiro, Kobayashi, Yusuke, Mühlenthaler, Moritz, Suzuki, Akira
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 30.05.2023
Subjects:	Combinatorial reconfiguration Fixed-parameter algorithms Non-deterministic constraint logic Combinatorial reconfiguration Non-deterministic constraint logic Fixed-parameter algorithms
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!