Applying the Neural Bellman-Ford Model to the Single Source Shortest Path Problem

Spyridon Drakakis; Constantine Kotropoulos

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

Applying the Neural Bellman-Ford Model to the Single Source Shortest Path Problem

Topics: Data Mining and Algorithms for Big Data; Deep Learning and Neural Networks; Information Retrieval

In Proceedings of the 13th International Conference on Pattern Recognition Applications and Methods ICPRAM - Volume 1, 386-393, 2024 , Rome, Italy

Authors: Spyridon Drakakis and Constantine Kotropoulos

Affiliation: Department of Informatics, Aristotle University of Thessaloniki, Thessaloniki 54124, Greece

Keyword(s): Message-Passing Neural Networks, Graph Neural Networks, Bellman-Ford Algorithm, Single-Source Shortest Paths.

Abstract: The Single Source Shortest Path problem aims to compute the shortest paths from a source node to all other nodes on a graph. It is solved using deterministic algorithms such as the Bellman-Ford, Dijkstra’s, and A* algorithms. This paper addresses the shortest path problem using a Message-Passing Neural Network model, the Neural Bellman Ford network, which is modified to conduct Predecessor Prediction. It provides a roadmap for developing models to calculate true optimal paths based on user preferences. Experimental results on real-world maps produced by the Open Street Map package show the ability of a Graph Neural Network to imitate the Bellman-Ford algorithm and solve the Single-Source Shortest Path problem.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 8.217.144.104

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

Drakakis, S. and Kotropoulos, C. (2024). Applying the Neural Bellman-Ford Model to the Single Source Shortest Path Problem. In Proceedings of the 13th International Conference on Pattern Recognition Applications and Methods - ICPRAM; ISBN 978-989-758-684-2; ISSN 2184-4313, SciTePress, pages 386-393. DOI: 10.5220/0012425800003654

@conference{icpram24,
author={Spyridon Drakakis and Constantine Kotropoulos},
title={Applying the Neural Bellman-Ford Model to the Single Source Shortest Path Problem},
booktitle={Proceedings of the 13th International Conference on Pattern Recognition Applications and Methods - ICPRAM},
year={2024},
pages={386-393},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012425800003654},
isbn={978-989-758-684-2},
issn={2184-4313},
}

TY - CONF

JO - Proceedings of the 13th International Conference on Pattern Recognition Applications and Methods - ICPRAM
TI - Applying the Neural Bellman-Ford Model to the Single Source Shortest Path Problem
SN - 978-989-758-684-2
IS - 2184-4313
AU - Drakakis, S.
AU - Kotropoulos, C.
PY - 2024
SP - 386
EP - 393
DO - 10.5220/0012425800003654
PB - SciTePress