<?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>Goel, Ashish(1-STF-MGE); Kapralov, Michael(1-STF-CPE); Khanna, Sanjeev(1-PA-C): Perfect matchings in O(n log n) time in regular bipartite graphs. (English summary). - STOC'10-Proceedings of the 2010 ACM International Symposium on Theory of Computing, 39-46, ACM, New York, 2010</dc:title><dc:creator>Vesel,	Aleksander	(Avtor)
	</dc:creator><dc:date>2011</dc:date><dc:date>2015-07-10 15:25:45</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>51944</dc:identifier><dc:identifier>UDK: 519.17:004(049.3)</dc:identifier><dc:identifier>OceCobissID: 50093825</dc:identifier><dc:identifier>COBISS_ID: 16144473</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:JPICTZDE</dc:identifier><dc:language>sl</dc:language></metadata>
