<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=7800"><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:language>sl</dc:language></rdf:Description></rdf:RDF>