<?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>Parallelizing an algorithm to decide if a bipartite graph is shellable</dc:title><dc:creator>Santamaría-Galvis,	Andrés	(Avtor)
	</dc:creator><dc:creator>Cruz Rodes,	Roberto	(Avtor)
	</dc:creator><dc:creator>Trefftz,	Christian	(Avtor)
	</dc:creator><dc:creator>Branch,	John W.	(Avtor)
	</dc:creator><dc:subject>graph theory</dc:subject><dc:subject>parallel algorithms</dc:subject><dc:subject>shellability</dc:subject><dc:date>2013</dc:date><dc:date>2021-10-18 09:09:03</dc:date><dc:type>Neznano</dc:type><dc:identifier>16999</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>OceCobissID: 77676035</dc:identifier><dc:identifier>DOI: 10.1109/EIT.2013.6632658</dc:identifier><dc:identifier>COBISS.SI-ID: 77677827</dc:identifier><dc:language>sl</dc:language></metadata>
