Tatsuya Gima, Yasuaki Kobayashi, Yota Otachi, Takumi Sato. Forcing a Unique Minimum Spanning Tree and a Unique Shortest Path. In Emilio Di Giacomo, Debajyoti Mondal, editors, WALCOM: Algorithms and Computation - 20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Perugia, Italy, March 4-6, 2026, Proceedings. Volume 16444 of Lecture Notes in Computer Science, pages 371-385, Springer, 2026. [doi]
@inproceedings{GimaKOS26,
title = {Forcing a Unique Minimum Spanning Tree and a Unique Shortest Path},
author = {Tatsuya Gima and Yasuaki Kobayashi and Yota Otachi and Takumi Sato},
year = {2026},
doi = {10.1007/978-981-95-7127-7_25},
url = {https://doi.org/10.1007/978-981-95-7127-7_25},
researchr = {https://researchr.org/publication/GimaKOS26},
cites = {0},
citedby = {0},
pages = {371-385},
booktitle = {WALCOM: Algorithms and Computation - 20th International Conference and Workshops on Algorithms and Computation, WALCOM 2026, Perugia, Italy, March 4-6, 2026, Proceedings},
editor = {Emilio Di Giacomo and Debajyoti Mondal},
volume = {16444},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-981-95-7127-7},
}