An algorithm for ranking paths in acyclic networks (Q1050909)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	An algorithm for ranking paths in acyclic networks	scientific article

Statements

scholarly article

An algorithm for ranking paths in acyclic networks (English)

publication date

1983

zbMATH Keywords

algorithm for ranking paths

acyclic networks

shortest tree

computational complexity

Ernesto de Queirós Vieira Martins

MaRDI profile type

MaRDI publication profile

Computing the <i>N</i> Best Loopless Paths in a Network

A bicriterion shortest path algorithm

An Appraisal of Some Shortest-Path Algorithms

A Method for the Solution of the <i>N</i> th Best Path Problem

Shortest Path and Network Flow Algorithms

On algorithms for finding the k shortest paths in a network

Finding the <i>K</i> Shortest Loopless Paths in a Network

Identifiers

zbMATH Open document ID

10.1007/BF01720017

Mathematics Subject Classification ID

zbMATH DE Number

Sitelinks

Mathematics(1 entry)

mardi Publication:1050909

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1050909&oldid=34681851"