<?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>On the complexity of the vector connectivity problem</dc:title><dc:creator>Cicalese,	Ferdinando	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:creator>Rizzi,	Romeo	(Avtor)
	</dc:creator><dc:subject>vector connectivity</dc:subject><dc:subject>APX-hardness</dc:subject><dc:subject>NP-hardness</dc:subject><dc:subject>polynomial-time algorithm</dc:subject><dc:subject>block graphs</dc:subject><dc:subject/><dc:date>2015</dc:date><dc:date>2016-06-09 03:13:03</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>7800</dc:identifier><dc:identifier>ISSN: 0304-3975</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>OceCobissID: 26525952</dc:identifier><dc:identifier>DOI: 10.1016/ j.tcs.2015.04.032</dc:identifier><dc:identifier>COBISS.SI-ID: 1537677764</dc:identifier><dc:language>sl</dc:language></metadata>
