A Solution for Finding Quasi-Shortest Path with Graph Coarsening

Takeaki Iwata, Keita Kitaura, Ryotaro Matsuo, Hiroyuki Ohsaki. A Solution for Finding Quasi-Shortest Path with Graph Coarsening. In International Conference on Information Networking, ICOIN 2022, Jeju-si, Republic of Korea, January 12-15, 2022. pages 215-219, IEEE, 2022. [doi]

@inproceedings{IwataKMO22,
  title = {A Solution for Finding Quasi-Shortest Path with Graph Coarsening},
  author = {Takeaki Iwata and Keita Kitaura and Ryotaro Matsuo and Hiroyuki Ohsaki},
  year = {2022},
  doi = {10.1109/ICOIN53446.2022.9687193},
  url = {https://doi.org/10.1109/ICOIN53446.2022.9687193},
  researchr = {https://researchr.org/publication/IwataKMO22},
  cites = {0},
  citedby = {0},
  pages = {215-219},
  booktitle = {International Conference on Information Networking, ICOIN 2022, Jeju-si, Republic of Korea, January 12-15, 2022},
  publisher = {IEEE},
  isbn = {978-1-6654-1332-9},
}