{"?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-YYI96HQV/5a949a84-ea81-48ab-b94e-897d0af6ade0/PDF","dcterms:extent":"167 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-YYI96HQV/458c4261-4bb9-4c00-a939-887eb4d49ae3/TEXT","dcterms:extent":"17 KB"}],"edm:TimeSpan":{"@rdf:about":"1977-2026","edm:begin":{"@xml:lang":"en","#text":"1977"},"edm:end":{"@xml:lang":"en","#text":"2026"}},"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-YYI96HQV","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-EE5UIE2V"},{"@xml:lang":"sl","#text":"Informatica (Ljubljana)"}],"dcterms:issued":"2006","dc:creator":"Fijavž, Gašper","dc:format":[{"@xml:lang":"sl","#text":"številka:3"},{"@xml:lang":"sl","#text":"letnik:30"},{"@xml:lang":"sl","#text":"str. 321-324"}],"dc:identifier":["ISSN:0350-5596","COBISSID:14187097","URN:URN:NBN:SI:doc-YYI96HQV"],"dc:language":"en","dc:publisher":{"@xml:lang":"sl","#text":"Slovensko društvo Informatika"},"dc:subject":[{"@xml:lang":"sl","#text":"algoritmi"},{"@xml:lang":"sl","#text":"barvanje grafov"},{"@xml:lang":"sl","#text":"matematika"},{"@xml:lang":"en","#text":"mathematics"},{"@xml:lang":"sl","#text":"teorija grafov"},{"@xml:lang":"sl","#text":"uteženi grafi"},{"@rdf:resource":"http://www.wikidata.org/entity/Q9038"}],"dcterms:temporal":{"@rdf:resource":"1977-2026"},"dc:title":{"@xml:lang":"sl","#text":"Coloring weighted series-parallel graphs|"},"dc:description":[{"@xml:lang":"sl","#text":"Let ?$G$? be a series-parallel graph with integer edge weights. A ?$p$?-coloring of ?$G$? is a mapping of vertices of ?$G$? into ?$\\ZZ_p$? (ring of integers modulo ?$p$?) so that the distance between colors of adjacent vertices of ?$u$? and ?$v$? is at least the weight of the edge ?$uv$?. We describe a quadratic time ?$p$?-coloring algorithm where ?$p$? is either twice the maximum edge weight or the largest possible sum of three weights of edges lying on a common cycle"},{"@xml:lang":"sl","#text":"Povezave vzporedno-zaporednega grafa ?$G$? utežimo s pozitivnimi celoštevilskimi utežmi. ?$p$?-barvanje grafa ?$G$? je taka preslikava točk grafa v ?$\\ZZ_p$? (kolobar ostankov po modulu ?$p$?), da sta barvi sosednjih točk ?$u$? in ?$v$? v ?$\\ZZ_p$? oddaljeni vsaj za utež povezave ?$uv$?. V članku predstavimo kvadratičen algoritem za ?$p$?-barvanje grafa ?$G$?, kjer je ?$p$? ali maksimalna vsota treh uteži povezav s skupnega cikla ali pa dvakratna utež najtežje povezave"}],"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-YYI96HQV","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-YYI96HQV"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-YYI96HQV/5a949a84-ea81-48ab-b94e-897d0af6ade0/PDF"},"edm:rights":{"@rdf:resource":"http://rightsstatements.org/vocab/InC/1.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":"Slovensko društvo Informatika"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-YYI96HQV/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-YYI96HQV"}}}}