<?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>An exact algorithm to find a maximum weight clique in a weighted undirected graph</dc:title><dc:creator>Rozman,	Kati	(Avtor)
	</dc:creator><dc:creator>Ghysels,	An	(Avtor)
	</dc:creator><dc:creator>Janežič,	Dušanka	(Avtor)
	</dc:creator><dc:creator>Konc,	Janez	(Avtor)
	</dc:creator><dc:date>2024</dc:date><dc:date>2024-04-30 08:26:50</dc:date><dc:type>Neznano</dc:type><dc:identifier>18846</dc:identifier><dc:identifier>UDK: 54</dc:identifier><dc:identifier>ISSN pri članku: 2045-2322</dc:identifier><dc:identifier>DOI: 10.1038/s41598-024-59689-x</dc:identifier><dc:identifier>COBISS_ID: 194177539</dc:identifier><dc:source>Scientific reports</dc:source><dc:language>sl</dc:language><dc:rights>© The Author(s) 2024</dc:rights></metadata>
