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...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 959; s. 113863
Hlavní autori:	Hatanaka, Tatsuhiko, Hommelsheim, Felix, Ito, Takehiro, Kobayashi, Yusuke, Mühlenthaler, Moritz, Suzuki, Akira
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 30.05.2023
Predmet:	Combinatorial reconfiguration Fixed-parameter algorithms Non-deterministic constraint logic Combinatorial reconfiguration Non-deterministic constraint logic Fixed-parameter algorithms
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!