{"?xml":{"@version":"1.0"},"edm:RDF":{"@xmlns:dc":"http://purl.org/dc/elements/1.1/","@xmlns:edm":"http://www.europeana.eu/schemas/edm/","@xmlns:wgs84_pos":"http://www.w3.org/2003/01/geo/wgs84_pos","@xmlns:foaf":"http://xmlns.com/foaf/0.1/","@xmlns:rdaGr2":"http://rdvocab.info/ElementsGr2","@xmlns:oai":"http://www.openarchives.org/OAI/2.0/","@xmlns:owl":"http://www.w3.org/2002/07/owl#","@xmlns:rdf":"http://www.w3.org/1999/02/22-rdf-syntax-ns#","@xmlns:ore":"http://www.openarchives.org/ore/terms/","@xmlns:skos":"http://www.w3.org/2004/02/skos/core#","@xmlns:dcterms":"http://purl.org/dc/terms/","edm:WebResource":[{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-KDKQY53L/98971c31-5fa5-45e4-b488-c09de2b39a2c/PDF","dcterms:extent":"318 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-KDKQY53L/6a396272-ca52-4358-ade7-f8779d36b69c/TEXT","dcterms:extent":"27 KB"}],"edm:TimeSpan":{"@rdf:about":"2008-2025","edm:begin":{"@xml:lang":"en","#text":"2008"},"edm:end":{"@xml:lang":"en","#text":"2025"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-KDKQY53L","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2014","dc:creator":["Hammack, Richard H.","Imrich, Wilfried"],"dc:format":[{"@xml:lang":"sl","#text":"številka:2"},{"@xml:lang":"sl","#text":"letnik:7"},{"@xml:lang":"sl","#text":"str. 487-497"}],"dc:identifier":["COBISSID:17164889","ISSN:1855-3966","URN:URN:NBN:SI:doc-KDKQY53L"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Društvo matematikov, fizikov in astronomov Slovenije"},"dc:subject":[{"@xml:lang":"en","#text":"algorithms"},{"@xml:lang":"sl","#text":"algoritmi"},{"@xml:lang":"sl","#text":"grafi"},{"@xml:lang":"en","#text":"graph products"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"Fast recognition of direct and strong products|"},"dc:description":{"@xml:lang":"sl","#text":"This note describes fast algorithms for computing the prime factors of connected, nonbipartite graphs with respect to the direct product, and of connected graphs with respect to the strong product. The complexities are ?$O(m \\min(n^2, \\Delta^3))$? for the direct product, and ?$O(m \\; a(G) \\Delta)$? for the strong, where ?$n$? is the order of the graph ?$G$? to be factored, ?$m$? its size, ?$a(G)$? its arboricity, and ?$\\Delta$? its maximum degree. That is, the complexities are linear in ?$m$? for fixed ?$\\Delta$?"},"edm:type":"TEXT","dc:type":[{"@xml:lang":"sl","#text":"znanstveno časopisje"},{"@xml:lang":"en","#text":"journals"},{"@rdf:resource":"http://www.wikidata.org/entity/Q361785"}]},"ore:Aggregation":{"@rdf:about":"http://www.dlib.si/?URN=URN:NBN:SI:doc-KDKQY53L","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-KDKQY53L"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-KDKQY53L/98971c31-5fa5-45e4-b488-c09de2b39a2c/PDF"},"edm:rights":{"@rdf:resource":"http://creativecommons.org/licenses/by/4.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:intermediateProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:dataProvider":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za naravoslovje, matematiko in informacijske tehnologije"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-KDKQY53L/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-KDKQY53L"}}}}