Finding the shortest paths by node combination
type: Item
instance of: scholarly article
title: Finding the shortest paths by node combination
zbMATH Open document ID: 1211.90262
author: Xin Lu
author: Martin Camitz
published in: Applied Mathematics and Computation
publication date: 2011-03-28T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5870905
zbMATH Keywords: Dijkstra's algorithm
zbMATH Keywords: weight matrix
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
full work available at URL: j.amc.2011.01.019
OpenAlex ID: W1969743129
cites work: Network Optimization Problems: Algorithms, Applications and Complexity
cites work: Handbook of applied optimization
cites work: A note on two problems in connexion with graphs
cites work: On a routing problem
cites work: Q5514188
cites work: A Theorem on Boolean Matrices
cites work: Q5583697
cites work: Q3651735
cites work: Q3056948
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Shortest paths algorithms: Theory and experimental evaluation
cites work: Experimental and Efficient Algorithms
cites work: An extension of labeling techniques for finding shortest path trees
cites work: An improved Dijkstra's shortest path algorithm for sparse network
cites work: Q3707420
cites work: Q3267900
cites work: Collective dynamics of ‘small-world’ networks
cites work: Complex networks: structure and dynamics
cites work: The Structure and Function of Complex Networks
DOI: 10.1016/J.AMC.2011.01.019
description: scientific article; zbMATH DE number 5870905