<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-80QO6PXU</identifier><date>2017</date><creator>Gerbner, Dániel</creator><creator>Keszegh, Balázs</creator><creator>Pálvölgyi, Dömötör</creator><creator>Rote, Günter</creator><creator>Wiener, Gábor</creator><relation>documents/doc/8/URN_NBN_SI_doc-80QO6PXU_001.pdf</relation><relation>documents/doc/8/URN_NBN_SI_doc-80QO6PXU_001.txt</relation><format format_type="volume">12</format><format format_type="issue">2</format><format format_type="type">article</format><format format_type="extent">str. 301-314</format><identifier identifier_type="COBISSID">18165081</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-80QO6PXU</identifier><language>eng</language><publisher>Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="slv">grafi</subject><title>Search for the end of a path in the d-dimensional grid and in other graphs</title></Record>