<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:doc-KDKQY53L</identifier><date>2014</date><creator>Hammack, Richard H.</creator><creator>Imrich, Wilfried</creator><relation>documents/doc/K/URN_NBN_SI_doc-KDKQY53L_001.pdf</relation><relation>documents/doc/K/URN_NBN_SI_doc-KDKQY53L_001.txt</relation><format format_type="issue">2</format><format format_type="volume">7</format><format format_type="type">article</format><format format_type="extent">str. 487-497</format><identifier identifier_type="COBISSID">17164889</identifier><identifier identifier_type="ISSN">1855-3966</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-KDKQY53L</identifier><language>eng</language><publisher>Društvo matematikov, fizikov in astronomov Slovenije</publisher><source>Ars mathematica contemporanea</source><rights>BY</rights><subject language_type_id="eng">algorithms</subject><subject language_type_id="slv">algoritmi</subject><subject language_type_id="slv">grafi</subject><subject language_type_id="eng">graph products</subject><subject language_type_id="slv">teorija grafov</subject><title>Fast recognition of direct and strong products</title></Record>