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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 86; no. 11; pp. 3395 - 3424
Main Authors:	Gima, Tatsuya, Ito, Takehiro, Kobayashi, Yasuaki, Otachi, Yota
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.11.2024 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!