<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-4AU4V81V</identifier><date>2021</date><creator>Szabo, Sandor</creator><creator>Zavalnij, Bogdan</creator><relation>documents/doc/4/URN_NBN_SI_doc-4AU4V81V_001.pdf</relation><relation>documents/doc/4/URN_NBN_SI_doc-4AU4V81V_001.txt</relation><format format_type="issue">2</format><format format_type="volume">45</format><format format_type="type">article</format><format format_type="extent">str. 197-204</format><identifier identifier_type="ISSN">0350-5596</identifier><identifier identifier_type="DOI">10.31449/inf.v45i2.3107</identifier><identifier identifier_type="COBISSID_HOST">79896067</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-4AU4V81V</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">klike</subject><subject language_type_id="slv">optimizacija</subject><subject language_type_id="slv">računalništvo</subject><subject language_type_id="slv">teorija grafov</subject><title>Estimating clique size via discarding subgraphs</title></Record>