@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00917828v1> a dcat:Dataset ;
    dct:description """
              In the present paper, we study bottleneck labeled optimization problems arising in the context of graph theory. This long-established model partitions the set of edges into classes, each of which is identified by a unique color. The generic objective is to construct a subgraph of prescribed structure (such as that of being an s-t path, a spanning tree, or a perfect matching) while trying to avoid over-picking or under-picking edges from any given color.
            """ ;
    dct:identifier "hal-00917828" ;
    dct:issued "2026-05-07T20:11:12.072241"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-07T20:11:12.072247"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "The complexity of Bottleneck Labeled Graph Problems" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00917828v1/resource/c199a5e5-dbe8-48e1-8ec1-4b955caa2d22> ;
    dcat:keyword "approximation-algorithms",
        "bottleneck-labeled-problems",
        "hardness-of-approximation",
        "infoeu-reposemanticspreprint",
        "infoinfo-cccomputer-science-cscomputational-complexity-cscc",
        "infoinfo-dscomputer-science-csdata-structures-and-algorithms-csds",
        "infoinfo-rocomputer-science-csoperations-research-mathoc",
        "perfect-matching",
        "preprints-working-papers-",
        "s-t-cut",
        "s-t-path",
        "spanning-tree" ;
    dcat:landingPage <https://hal.science/hal-00917828> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00917828v1/resource/c199a5e5-dbe8-48e1-8ec1-4b955caa2d22> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-07T20:11:12.082613"^^xsd:dateTime ;
    dct:modified "2026-05-07T20:11:12.056315"^^xsd:dateTime ;
    dct:title "The complexity of Bottleneck Labeled Graph Problems" ;
    dcat:accessURL <https://hal.science/hal-00917828> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://hal.science/hal-00917828> a foaf:Document .