<?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>Computing the Szeged index</dc:title><dc:creator>Žerovnik,	Janez	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>chemistry</dc:subject><dc:subject>chemical graph theory</dc:subject><dc:subject>molecular graphs</dc:subject><dc:subject>structural formulae</dc:subject><dc:subject>algorithms</dc:subject><dc:subject>topological index</dc:subject><dc:subject>Szeged index</dc:subject><dc:description>We give an explicit algorithm for computing the Szeged index of a graph which runs in ▫$O(mn)$▫ time, where ▫$n$▫ is the number of nodes and ▫$m$▫ is the number of edges.</dc:description><dc:date>1996</dc:date><dc:date>2017-07-05 08:52:26</dc:date><dc:type>Znanstveno delo</dc:type><dc:identifier>66649</dc:identifier><dc:identifier>ISSN: 0011-1643</dc:identifier><dc:identifier>UDK: 519.17:541</dc:identifier><dc:identifier>OceCobissID: 22807</dc:identifier><dc:identifier>COBISS_ID: 2415126</dc:identifier><dc:identifier>ISSN pri članku: 0011-1643</dc:identifier><dc:identifier>NUK URN: URN:SI:UM:DK:CDPQSMWL</dc:identifier><dc:language>sl</dc:language></metadata>
