2022
DOI: 10.30684/etj.2022.136107.1296
|View full text |Cite
|
Sign up to set email alerts
|

A Modification of Shortest Path Algorithm According to Adjustable Weights Based on Dijkstra Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…This article proposed that an acceptable solution must contain features from both the contentbased and link-based ranking domains integrated with the temporal features and users' behavior information. [25] A Modification of Shortest Path Algorithm According to Adjustable Weights Based on Dijkstra Algorithm…”
Section: Reference No Previous Workmentioning
confidence: 99%
“…This article proposed that an acceptable solution must contain features from both the contentbased and link-based ranking domains integrated with the temporal features and users' behavior information. [25] A Modification of Shortest Path Algorithm According to Adjustable Weights Based on Dijkstra Algorithm…”
Section: Reference No Previous Workmentioning
confidence: 99%