A Tag-Constrained Top-k Shortest Path for Finding Diverse Routes

Bagus Jati Santoso, Ibrahim Tamtama Adi, Royyana Muslim Ijtihadie

Open source

DOI
10.23887/janapati.v14i2.95815
Published
2025-07-06
Container
Jurnal Nasional Pendidikan Teknik Informatika (JANAPATI)
Publisher
Universitas Pendidikan Ganesha
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.23887/janapati.v14i2.95815,
  title = {A Tag-Constrained Top-k Shortest Path for Finding Diverse Routes},
  author = {Bagus Jati Santoso and Ibrahim Tamtama Adi and Royyana Muslim Ijtihadie},
  year = {2025},
  journal = {Jurnal Nasional Pendidikan Teknik Informatika (JANAPATI)},
  doi = {10.23887/janapati.v14i2.95815},
  url = {https://doi.org/10.23887/janapati.v14i2.95815}
}

RIS

TY  - JOUR
TI  - A Tag-Constrained Top-k Shortest Path for Finding Diverse Routes
AU  - Bagus Jati Santoso
AU  - Ibrahim Tamtama Adi
AU  - Royyana Muslim Ijtihadie
PY  - 2025
JO  - Jurnal Nasional Pendidikan Teknik Informatika (JANAPATI)
DO  - 10.23887/janapati.v14i2.95815
UR  - https://doi.org/10.23887/janapati.v14i2.95815
ER  - 

APA

Santoso, B. J., Adi, I. T., & Ijtihadie, R. M. (2025). A Tag-Constrained Top-k Shortest Path for Finding Diverse Routes. Jurnal Nasional Pendidikan Teknik Informatika (JANAPATI). https://doi.org/10.23887/janapati.v14i2.95815

Source records