<?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=10060"><dc:title>A dichotomy for weighted efficient dominating sets with bounded degree vertices</dc:title><dc:creator>Brandstädt,	Andreas	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:subject>weighted efficient domination</dc:subject><dc:subject>bounded degree vertices</dc:subject><dc:subject>k-Bounded Weighted Efficient Domination</dc:subject><dc:subject>polynomial-time algorithm</dc:subject><dc:subject>graph algorithms</dc:subject><dc:date>2019</dc:date><dc:date>2019-01-21 10:49:43</dc:date><dc:type>Neznano</dc:type><dc:identifier>10060</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>