Algorithmic Meta-Theorems for Combinatorial Reconfiguration Revisited

Given a graph and two vertex sets satisfying a certain feasibility condition, a reconfiguration problem asks whether we can reach one vertex set from the other by repeating prescribed modification steps while maintaining feasibility. In this setting, as reported by Mouawad et al. (IPEC, Springer, Be...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 86; číslo 11; s. 3395 - 3424
Hlavní autori:	Gima, Tatsuya, Ito, Takehiro, Kobayashi, Yasuaki, Otachi, Yota
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.11.2024 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Completeness Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Feasibility Mathematics of Computing Parameterization Parameters Reconfiguration Theorems Theory of Computation Vertex sets Combinatorial reconfiguration Neighborhood diversity Fixed-parameter tractability Monadic second-order logic Treedepth
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!