Reconfiguring directed trees in a digraph

DOI10.1007/978-3-030-89543-3_29MaRDI QIDQ2695298zbMATH OpenOpenAlexFDO

Authors Takehiro Ito, Yuni Iwamasa, Yasuaki Kobayashi, Yu Nakahata, Yota Otachi, Kunihiro Wasa

Publication date 30 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-89543-3_29

zbMATH Keywords

combinatorial reconfigurationgraph algorithm

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• Degree-constrained subgraph reconfiguration is in P
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• On the complexity of reconfiguration problems
• Reconfiguring undirected paths
• The complexity of Snake and undirected NCL variants
• The parameterized complexity of motion planning for snake-like robots

Cited in

(2)

• Reconfiguring (non-spanning) arborescences
• Brief announcement: Distributed reconfiguration of spanning trees

This page was built for publication: Reconfiguring directed trees in a digraph

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