<?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 polynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs</dc:title><dc:creator>Husić,	Edin	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:subject>independent set</dc:subject><dc:subject>augmenting graph</dc:subject><dc:subject>polynomial-time algorithm</dc:subject><dc:date>2019</dc:date><dc:date>2019-10-16 11:12:08</dc:date><dc:type>Neznano</dc:type><dc:identifier>11980</dc:identifier><dc:identifier>UDK: 519.17:004</dc:identifier><dc:identifier>ISSN pri članku: 0302-9743</dc:identifier><dc:identifier>OceCobissID: 1541564612</dc:identifier><dc:identifier>DOI: 10.1007/978-3-030-30786-8_21</dc:identifier><dc:identifier>COBISS.SI-ID: 1541565380</dc:identifier><dc:language>sl</dc:language></metadata>
