Solving all-pairs shortest path by single-source computations : theory and practice

SLO

First page / Show document

Show document

A- | A+ | Print

Title:	Solving all-pairs shortest path by single-source computations : theory and practice
Authors:	ID Brodnik, Andrej (Author) ID Grgurovič, Marko (Author)
Files:	https://doi.org/10.1016/j.dam.2017.03.008
Language:	English
Work type:	Unknown
Typology:	1.01 - Original Scientific Article
Organization:	FAMNIT - Faculty of Mathematics, Science and Information Technologies
Keywords:	all pairs shortest path, single source shortest path
Year of publishing:	2017
Number of pages:	str. 119-130
Numbering:	#Vol. #231
PID:	20.500.12556/RUP-9455
UDC:	004.02
ISSN on article:	0166-218X
DOI:	10.1016/j.dam.2017.03.008
COBISS.SI-ID:	1540083908
Publication date in RUP:	02.02.2018
Views:	6504
Downloads:	115
Metadata:
:	Copy citation

Average score:	(0 votes)
Your score:	Voting is allowed only for logged in users.
Share:

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Title:	Discrete applied mathematics
Shortened title:	Discrete appl. math.
Publisher:	Elsevier
ISSN:	0166-218X
COBISS.SI-ID:	25342464

Leave comment

You must log in to leave a comment.

Comments (0)

0 - 0 / 0

There are no comments!

Back