{"?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-O142F3WI/88c0010a-b2e8-4471-ad7f-2681a5be60cf/PDF","dcterms:extent":"279 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-O142F3WI/baadcf82-9303-4b09-a749-d66b6e558cf5/TEXT","dcterms:extent":"23 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-O142F3WI","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-UP1WMFAR"},{"@xml:lang":"sl","#text":"Ars mathematica contemporanea"}],"dcterms:issued":"2016","dc:creator":["Boiko, Tetiana","Cuno, Johannes","Imrich, Wilfried","Lehner, Florian","Woestijne, Christiaan van de"],"dc:format":[{"@xml:lang":"sl","#text":"številka:1"},{"@xml:lang":"sl","#text":"letnik:11"},{"@xml:lang":"sl","#text":"str. 1-9"}],"dc:identifier":["COBISSID:17836121","ISSN:1855-3966","URN:URN:NBN:SI:doc-O142F3WI"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Univerza na Primorskem, Fakulteta za matematiko, naravoslovje in informacijske tehnologije"},"dc:subject":[{"@xml:lang":"en","#text":"algorithms"},{"@xml:lang":"sl","#text":"algoritmi"},{"@xml:lang":"en","#text":"factorization"},{"@xml:lang":"sl","#text":"faktorizacija"},{"@xml:lang":"sl","#text":"grafi"},{"@xml:lang":"en","#text":"graphs"},{"@xml:lang":"sl","#text":"monoidi"},{"@xml:lang":"en","#text":"monoids"}],"dcterms:temporal":{"@rdf:resource":"2008-2025"},"dc:title":{"@xml:lang":"sl","#text":"The Cartesian product of graphs with loops|"},"dc:description":[{"@xml:lang":"sl","#text":"We extend the definition of the Cartesian product to graphs with loops and show that the Sabidussi-Vizing unique factorization theorem for connected finite simple graphs still holds in this context for all connected finite graphs with at least one unlooped vertex. We also prove that this factorization can be computed in ?$O(m)$? time, where ?$m$? is the number of edges of the given graph"},{"@xml:lang":"sl","#text":"Definicijo kartezičnega produkta razširimo na grafe z zankami in pokažemo, da Sabidussi-Vizingov izrek o enolični faktorizaciji povezanih končnih enostavnih grafov še vedno velja v tem kontekstu za vse povezane končne grafe z najmanj enim vozliščem brez zanke. Pokažemo tudi, da lahko to faktorizacijo izračunamo v ?$O(m)$? časa, kjer je ?$m$? število povezav danega grafa"}],"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-O142F3WI","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-O142F3WI"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-O142F3WI/88c0010a-b2e8-4471-ad7f-2681a5be60cf/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-O142F3WI/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-O142F3WI"}}}}