Reconfiguring (non-spanning) arborescences
Ito, Takehiro, Iwamasa, Yuni, Kobayashi, Yasuaki, Nakahata, Yu, Otachi, Yota, Wasa, Kunihiro
Published in Theoretical computer science (17.01.2023)
Published in Theoretical computer science (17.01.2023)
Get full text
Journal Article
Reconfiguring (non-spanning) arborescences
Ito, Takehiro, Iwamasa, Yuni, Kobayashi, Yasuaki, Nakahata, Yu, Otachi, Yota, Wasa, Kunihiro
Published in arXiv.org (14.03.2023)
Published in arXiv.org (14.03.2023)
Get full text
Paper
Journal Article
ZDD-Based Algorithmic Framework for Solving Shortest Reconfiguration Problems
Ito, Takehiro, Kawahara, Jun, Nakahata, Yu, Soh, Takehide, Suzuki, Akira, Teruyama, Junichi, Toda, Takahisa
Published in arXiv.org (16.12.2022)
Published in arXiv.org (16.12.2022)
Get full text
Paper
Journal Article
Independent set reconfiguration on directed graphs
Ito, Takehiro, Iwamasa, Yuni, Kobayashi, Yasuaki, Nakahata, Yu, Otachi, Yota, Takahashi, Masahiro, Wasa, Kunihiro
Published in arXiv.org (25.03.2022)
Published in arXiv.org (25.03.2022)
Get full text
Paper
Journal Article
Compiling Crossing-free Geometric Graphs with Connectivity Constraint for Fast Enumeration, Random Sampling, and Optimization
Nakahata, Yu, Horiyama, Takashi, Minato, Shin-ichi, Yamanaka, Katsuhisa
Published in arXiv.org (24.01.2020)
Published in arXiv.org (24.01.2020)
Get full text
Paper
Journal Article
Implicit Enumeration of Topological-Minor-Embeddings and Its Application to Planar Subgraph Enumeration
Nakahata, Yu, Kawahara, Jun, Horiyama, Takashi, Minato, Shin-ichi
Published in arXiv.org (18.11.2019)
Published in arXiv.org (18.11.2019)
Get full text
Paper
Journal Article
Decomposing a Graph into Unigraphs
Horiyama, Takashi, Kawahara, Jun, Minato, Shin-ichi, Nakahata, Yu
Published in arXiv.org (20.04.2019)
Published in arXiv.org (20.04.2019)
Get full text
Paper
Journal Article