<?xml version="1.0"?>
<metadata xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/"><dc:title>Solving all-pairs shortest path by single-source computations</dc:title><dc:creator>Brodnik,	Andrej	(Avtor)
	</dc:creator><dc:creator>Grgurovič,	Marko	(Avtor)
	</dc:creator><dc:subject>all pairs shortest path</dc:subject><dc:subject>single source shortest path</dc:subject><dc:date>2017</dc:date><dc:date>2018-02-02 10:05:55</dc:date><dc:type>Neznano</dc:type><dc:identifier>9455</dc:identifier><dc:identifier>UDK: 004.02</dc:identifier><dc:identifier>ISSN pri članku: 0166-218X</dc:identifier><dc:identifier>OceCobissID: 25342464</dc:identifier><dc:identifier>DOI: 10.1016/j.dam.2017.03.008</dc:identifier><dc:identifier>COBISS.SI-ID: 1540083908</dc:identifier><dc:language>sl</dc:language></metadata>
