OpenAlex | A Universal Concept for Robust Solving of Shortest Path Problems in Dynamically Reconfigurable Graphs

A Universal Concept for Robust Solving of Shortest Path Problems in Dynamically Reconfigurable Graphs

Work

Year: 2015

Type: article

Abstract: This paper develops a flexible analytical concept for robust shortest path detection in dynamically reconfigurable graphs. The concept is expressed by a mathematical model representing the shortest pa... more

Source: Mathematical Problems in Engineering

Authors Jean Chamberlain Chedjou, Kyandoghere Kyamakya

Institution University of Klagenfurt

Cites: 43

Cited by: 3

Related to: 10

FWCI: 0.14

Citation percentile (by year/subfield): 49.55

Topic: VLSI and FPGA Design Techniques

Subfield: Electrical and Electronic Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: gold

APC paid (est): $2,400