Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra
オープンアクセス
-
- 野崎 雄太
- 横浜国立大学
書誌事項
- タイトル
- Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra
- 著者
- Takehiro Ito、Naonori Kakimura、Naoyuki Kamiyama、Yusuke Kobayashi、Shun-ichi Maezawa、Yuta Nozaki、Yoshio Okamoto
収録刊行物
-
- Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023)
-
Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP 2023) － 2023