<?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>Bonsma, Paul; Paulusma, Daniël: Using contracted solution graphs for solving reconfiguration problems. (English summary) Acta Inform. 56 (2019), no. 7-8, 619-648.</dc:title><dc:creator>Dallard,	Clément Jean	(Avtor)
	</dc:creator><dc:subject>reconfiguration</dc:subject><dc:subject>dynamic programming</dc:subject><dc:subject>graph coloring</dc:subject><dc:date>2021</dc:date><dc:date>2021-10-26 08:16:50</dc:date><dc:type>Neznano</dc:type><dc:identifier>17046</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>ISSN pri članku: 2167-5163</dc:identifier><dc:identifier>COBISS.SI-ID: 82167555</dc:identifier><dc:language>sl</dc:language></metadata>
