<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-X0R743GU</identifier><date>2013</date><creator>D'Angelo, Gianlorenzo</creator><creator>D'Emidio, Mattia</creator><creator>Frigioni, Daniele</creator><relation>documents/doc/X/URN_NBN_SI_doc-X0R743GU_001.pdf</relation><relation>documents/doc/X/URN_NBN_SI_doc-X0R743GU_001.txt</relation><format format_type="issue">3</format><format format_type="volume">37</format><format format_type="type">article</format><format format_type="extent">str. 253-265</format><identifier identifier_type="ISSN">0350-5596</identifier><identifier identifier_type="COBISSID">277359360</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-X0R743GU</identifier><language>eng</language><publisher>Slovensko društvo Informatika</publisher><source>Informatica (Ljubljana)</source><rights>InC</rights><subject language_type_id="slv">DLP</subject><subject language_type_id="slv">informatika</subject><subject language_type_id="eng">information science</subject><subject language_type_id="slv">komunikacijska omrežja</subject><subject language_type_id="slv">porazdeljeni algoritmi</subject><title>Pruning the computation of distributed shortest paths in power-law networks</title></Record>