<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-IR8QS5DD</identifier><date>2019</date><creator>Szabo, Sandor</creator><creator>Zavalnij, Bogdan</creator><relation>documents/doc/I/URN_NBN_SI_doc-IR8QS5DD_001.pdf</relation><relation>documents/doc/I/URN_NBN_SI_doc-IR8QS5DD_001.txt</relation><format format_type="issue">2</format><format format_type="volume">43</format><format format_type="type">article</format><format format_type="extent">str. 177-186</format><identifier identifier_type="ISSN">0350-5596</identifier><identifier identifier_type="COBISSID_HOST">32933927</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-IR8QS5DD</identifier><language>eng</language><publisher>Slovensko društvo Informatika</publisher><source>Informatica (Ljubljana)</source><rights>BY</rights><subject language_type_id="slv">algoritmi</subject><subject language_type_id="slv">iskalni algoritmi</subject><subject language_type_id="slv">iskanje</subject><subject language_type_id="slv">računalništvo</subject><subject language_type_id="slv">testiranje</subject><title>Benchmark problems for exhaustive exact maximum clique search algorithms</title></Record>