<?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=16313"><dc:title>Complexity and algorithms for constant diameter augmentation problems</dc:title><dc:creator>Kim,	Eun Jung	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:creator>Monnot,	Jérôme	(Avtor)
	</dc:creator><dc:creator>Picouleau,	Christophe	(Avtor)
	</dc:creator><dc:subject>graph diameter</dc:subject><dc:subject>blocker problem</dc:subject><dc:subject>polynomial algorithm</dc:subject><dc:subject>NP-complete problem</dc:subject><dc:date>2021</dc:date><dc:date>2021-06-04 10:41:49</dc:date><dc:type>Neznano</dc:type><dc:identifier>16313</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>