{"?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-21VAP707/da03a3cf-1c4e-418b-8455-7868ab01bbcb/PDF","dcterms:extent":"259 KB"},{"@rdf:about":"http://www.dlib.si/stream/URN:NBN:SI:doc-21VAP707/85b67f06-60e2-4e3a-b6dc-8109c9a0e3d8/TEXT","dcterms:extent":"0 KB"}],"edm:ProvidedCHO":{"@rdf:about":"URN:NBN:SI:doc-21VAP707","dcterms:isPartOf":[{"@rdf:resource":"https://www.dlib.si/details/URN:NBN:SI:spr-OE00UKYR"},{"@xml:lang":"sl","#text":"Matrika"}],"dcterms:issued":"2025","dc:creator":"Rupnik, Anja","dc:format":[{"@xml:lang":"sl","#text":"številka:1"},{"@xml:lang":"sl","#text":"letnik:12"},{"@xml:lang":"sl","#text":"14 str."}],"dc:identifier":["COBISSID_HOST:233019651","ISSN:2385-8567","URN:URN:NBN:SI:doc-21VAP707"],"dc:language":"sl","dc:publisher":{"@xml:lang":"sl","#text":"Založba Fakultete za matematiko in fiziko Univerze v Ljubljani"},"dc:subject":[{"@xml:lang":"en","#text":"graph theory"},{"@xml:lang":"en","#text":"matchings"},{"@xml:lang":"en","#text":"popular matchings"},{"@xml:lang":"sl","#text":"popularna prirejanja"},{"@xml:lang":"sl","#text":"prirejanja"},{"@xml:lang":"sl","#text":"teorija grafov"}],"dc:title":{"@xml:lang":"sl","#text":"Popularna prirejanja|"},"dc:description":[{"@xml:lang":"sl","#text":"This article discusses various matchings in graphs and their properties. It first focuses on maximum and stable matchings in weighted bipartite graphs, and then introduce popular matchings, a compromise between these two concepts. The article also presents the Gale-Shapley algorithm for computing a stable matching and an algorithm for computing a largest popular matching in weighted bipartite graphs"},{"@xml:lang":"sl","#text":"Ta članek obravnava različna prirejanja v grafih in njihove lastnosti. Najprej se osredotoči na največja in stabilna prirejanja v dvodelnih grafih z utežmi, nato pa se kot kompromis med tema dvema konceptoma uvede popularna prirejanja. Predstavi tudi Gale-Shapleyjev algoritem za iskanje stabilnih prirejanj in algoritem za iskanje največjih popularnih prirejanj v dvodelnih grafih z utežmi"}],"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-21VAP707","edm:aggregatedCHO":{"@rdf:resource":"URN:NBN:SI:doc-21VAP707"},"edm:isShownBy":{"@rdf:resource":"http://www.dlib.si/stream/URN:NBN:SI:doc-21VAP707/da03a3cf-1c4e-418b-8455-7868ab01bbcb/PDF"},"edm:rights":{"@rdf:resource":"http://rightsstatements.org/vocab/InC/1.0/"},"edm:provider":"Slovenian National E-content Aggregator","edm:dataProvider":{"@xml:lang":"en","#text":"National and University Library of Slovenia"},"edm:object":{"@rdf:resource":"http://www.dlib.si/streamdb/URN:NBN:SI:doc-21VAP707/maxi/edm"},"edm:isShownAt":{"@rdf:resource":"http://www.dlib.si/details/URN:NBN:SI:doc-21VAP707"}}}}