- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra
Open Access
-
- 野崎 雄太
- 横浜国立大学
Bibliographic Information
- Title
- Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra
- Author
- Takehiro Ito、Naonori Kakimura、Naoyuki Kamiyama、Yusuke Kobayashi、Shun-ichi Maezawa、Yuta Nozaki、Yoshio Okamoto
Journal
-
- 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
- Tweet
Details 詳細情報について
-
- CRID
- 1010021219007551235
-
- Article Type
- journal article
-
- Data Source
-
- KAKEN