<?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>Bipartite graphs of small readability</dc:title><dc:creator>Chikhi,	Rayan	(Avtor)
	</dc:creator><dc:creator>Jovičić,	Vladan	(Avtor)
	</dc:creator><dc:creator>Kratsch,	Stefan	(Avtor)
	</dc:creator><dc:creator>Medvedev,	Paul	(Avtor)
	</dc:creator><dc:creator>Milanič,	Martin	(Avtor)
	</dc:creator><dc:creator>Raskhodnikova,	Sofya	(Avtor)
	</dc:creator><dc:creator>Varma,	Nithin	(Avtor)
	</dc:creator><dc:subject>bipartite graph</dc:subject><dc:subject>readability</dc:subject><dc:subject>bipartite chain graph</dc:subject><dc:subject>polynomial-time algorithm</dc:subject><dc:subject>grid graph</dc:subject><dc:date>2019</dc:date><dc:date>2019-07-26 09:43:06</dc:date><dc:type>Neznano</dc:type><dc:identifier>11821</dc:identifier><dc:identifier>UDK: 519.17</dc:identifier><dc:identifier>ISSN pri članku: 0304-3975</dc:identifier><dc:identifier>OceCobissID: 26525952</dc:identifier><dc:identifier>DOI: 10.1016/j.tcs.2019.07.022</dc:identifier><dc:identifier>COBISS.SI-ID: 1541431236</dc:identifier><dc:language>sl</dc:language></metadata>
