<?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>On the end-vertex problem of graph searches</dc:title><dc:creator>Beisegel,	Jesse	(Avtor)
	</dc:creator><dc:creator>Denkert,	Carolin	(Avtor)
	</dc:creator><dc:creator>Köhler,	Ekkehard	(Avtor)
	</dc:creator><dc:creator>Krnc,	Matjaž	(Avtor)
	</dc:creator><dc:creator>Pivač,	Nevena	(Avtor)
	</dc:creator><dc:creator>Scheffler,	Robert	(Avtor)
	</dc:creator><dc:creator>Strehler,	Martin	(Avtor)
	</dc:creator><dc:subject>end-vertex</dc:subject><dc:subject>graph search</dc:subject><dc:subject>maximum cardinality search</dc:subject><dc:subject>maximal neighborhood search</dc:subject><dc:subject>graph classes</dc:subject><dc:date>2019</dc:date><dc:date>2019-08-22 18:21:57</dc:date><dc:type>Neznano</dc:type><dc:identifier>11894</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>ISSN pri članku: 1365-8050</dc:identifier><dc:identifier>OceCobissID: 8089433</dc:identifier><dc:identifier>COBISS.SI-ID: 1541461444</dc:identifier><dc:language>sl</dc:language></metadata>
