Changing induced subgraph isomorphisms under extended reconfiguration rules

DOI10.1016/J.IC.2025.105367MaRDI QIDQ6884302zbMATH OpenFDO

Authors Tatsuhiro Suga, Akira Suzuki, Yuma Tamura, Xiao Zhou

Publication date 15 December 2025

Published in Information and Computation (Search for Journal in Brave)

zbMATH Keywords

parameterized complexityPSPACE-completenessinduced subgraph isomorphismcombinatorial reconfigurationindependent set reconfigurationextended reconfiguration rule

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Changing induced subgraph isomorphisms under extended reconfiguration rules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884302)