"Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra."

Takehiro Ito et al. (2023)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2304.14782

access: open

type: Informal or Other Publication

metadata version: 2023-05-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2304-14782
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2304-14782
Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Shun-ichi Maezawa, Yuta Nozaki, Yoshio Okamoto:
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra. CoRR abs/2304.14782 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.