Algorithms 17-18 - The shortest paths from a fixed node in a network - Digital Repository of Scientific Institutes

Skip to main menu
Skip to search engine
Skip to content
Skip to footer

Algorithms 17-18 - The shortest paths from a fixed node in a network

Download

This publication is protected by copyright. Access to its digital version is possible on computer terminals in the institution that shares it.

This publication is protected by copyright. Access to its digital version is possible on computer terminals in the institution that shares it.

Title: Algorithms 17-18 - The shortest paths from a fixed node in a network

Creator:

Sysło, Maciej Marek

Date issued/created:

Resource type:

Subtitle:

Algorytmy 17-18 - Wyznaczanie najkrótszych dróg z ustalonego wierzchołka w sieci ; Applicationes Mathematicae T.13 (1972-1973) ; Zastosowania Matematyki T.13 (1972-1973)

Contributor:

Polska Akademia Nauk. Instytut Matematyczny.

Publisher:

Państwowe Wydawnictwo Naukowe

Place of publishing:

Warsaw ; Wrocław

Description:

25 cm ; Od t.8 (1965) tyt. równol. : Applicationes Mathematicae ; Abstract in Polish

Type of object:

Journal/Article

Volume:

Start page:

End page:

Detailed Resource Type:

Format:

application/pdf

Resource Identifier:

oai:rcin.org.pl:43729

Source:

IM PAN, call no. cz332 ; click here to follow the link

Language:

Rights:

Rights Reserved - Restricted Access

Terms of use:

Copyright-protected material. Access only on terminals at the Institute of Mathematics of the Polish Academy of Sciences, may be used within the limits of statutory user freedoms.

Digitizing institution:

Institute of Mathematics of the Polish Academy of Sciences

Original in:

Library of the Institute of Mathematics of the Polish Academy of Sciences

Projects co-financed by:

Programme Innovative Economy, 2010-2014, Priority Axis 2. R&D infrastructure ; European Union. European Regional Development Fund

Access:

Subject and keywords:

Matematyka -- czasopisma. [KABA] Matematyka -- zastosowania naukowe -- czasopisma. [KABA]

Object collections:

Last modified:

Mar 28, 2022

In our library since:

Apr 24, 2014

Number of object content downloads / hits:

8

All available object's versions:

https://rcin.org.pl./publication/60184

Show description in RDF format:

Show description in RDFa format:

Show description in OAI-PMH format:

Zastosowania Matematyki = Applicationes Mathematicae, 1953-1993

Edition name	Date
Sysło, Maciej Marek, Algorithms 17-18 - The shortest paths from a fixed node in a network	Mar 28, 2022

Objects Similar

A solvable case of the set-partitioning problem

Sysło, Maciej Marek

1987

Journal/Article

Generalizations of the standard traveling salesman problem

Sysło, Maciej Marek

1977-1980

Journal/Article

Remark on algorithm 5

Sysło, Maciej Marek

1971-1972

Journal/Article

Algorithm 14 - Initial solution to the zero-one integral linear programming problem

Sysło, Maciej Marek

1971-1972

Journal/Article

Algorithm 5 - Solution of the transportation problem by Brigg's dual labaling method

Sysło, Maciej Marek

1969-1970

Journal/Article

A bisection method for the traveling salesman problem

Sysło, Maciej Marek

1977-1980

Journal/Article

Algorithm 36 - Transitive closure of a graph

Sysło, Maciej Marek

1974-1975

Journal/Article

Remarks on addition processes of positive floating-point numbers

Sysło, Maciej Marek

1974-1975

Journal/Article

More

Citation style:

iso690-author-date apa modern-language-association chicago-author-date

This page uses 'cookies'. More information