Presentation 2022-12-06
Complexity of Reconfiguring Vertex-Disjoint Shortest Paths
Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 組合せ遷移,グラフアルゴリズム,点素パス
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # COMP2022-22
Date of Issue 2022-11-29 (COMP)

Conference Information
Committee COMP
Conference Date 2022/12/6(1days)
Place (in Japanese) (See Japanese page)
Place (in English) Ehime Univ. Media Hall
Topics (in Japanese) (See Japanese page)
Topics (in English) Theoretical Computer Science, etc
Chair Hiroyuki Uno(Osaka Metropolitan Univ.)
Vice Chair Shuji Kijima(Shiga Univ.)
Secretary Shuji Kijima(Hosei Univ.)
Assistant Ei Ando(Senshu Univ.)

Paper Information
Registration To Technical Committee on Theoretical Foundations of Computing
Language ENG-JTITLE
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Complexity of Reconfiguring Vertex-Disjoint Shortest Paths
Sub Title (in English)
Keyword(1)
Keyword(2)
Keyword(3)
1st Author's Name Rin Saito
1st Author's Affiliation Tohoku University(Tohoku Univ.)
2nd Author's Name Hiroshi Eto
2nd Author's Affiliation Kyushu Institute of Technology(Kyutech)
3rd Author's Name Takehiro Ito
3rd Author's Affiliation Tohoku University(Tohoku Univ.)
4th Author's Name Ryuhei Uehara
4th Author's Affiliation Japan Advanced Institute of Science and Technology(JAIST)
Date 2022-12-06
Paper # COMP2022-22
Volume (vol) vol.122
Number (no) COMP-294
Page pp.pp.9-13(COMP),
#Pages 5
Date of Issue 2022-11-29 (COMP)