Reconfiguration of time-respecting arborescences

DOI10.1007/978-3-031-38906-1_34arXiv2305.07262MaRDI QIDQ6179438

Yusuke Kobayashi, Takehiro Ito, Naoyuki Kamiyama, Akira Suzuki, Yasuaki Kobayashi, Shun-ichi Maezawa, Yuni Iwamasa

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2305.07262

zbMATH Keywords

arborescencetemporal networkcombinatorial reconfiguration

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• On the complexity of reconfiguration problems
• The directed subgraph homeomorphism problem
• Arborescence optimization problems solvable by Edmonds' algorithm
• The complexity of Snake and undirected NCL variants
• Reconfiguring undirected paths
• Introduction to reconfiguration
• Reconfiguring (non-spanning) arborescences
• The Parameterized Complexity of Motion Planning for Snake-Like Robots
• Optimum branchings
• Matroids and the greedy algorithm
• Reconfiguration of Spanning Trees with Many or Few Leaves
• Connectivity and inference problems for temporal networks
• Reconfiguring spanning and induced subgraphs

This page was built for publication: Reconfiguration of time-respecting arborescences