<?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>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:identifier>UDK: 519.17</dc:identifier><dc:identifier>ISSN pri članku: 0020-0190</dc:identifier><dc:identifier>OceCobissID: 25612800</dc:identifier><dc:identifier>DOI: 10.1016/j.ipl.2018.10.007</dc:identifier><dc:identifier>COBISS.SI-ID: 1540954052</dc:identifier><dc:language>sl</dc:language></metadata>
