@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-00085561v1> a dcat:Dataset ;
    dct:description """
              We show that for a graph $G$ on $n$ vertices its treewidth can be computed in $\\mathcal{O}(poly(n) 1.9601^n)$ time. Our result is based on combinatorial upper bounds for the number of minimal separators and the number of potential maximal cliques of a graph.
            """ ;
    dct:identifier "hal-00085561" ;
    dct:issued "2026-05-09T23:25:52.579990"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-09T23:25:52.579995"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00085561v1/resource/e22f76e5-e5f1-4e0f-8d44-d3b953b30bfe> ;
    dcat:keyword "conference-papers",
        "exponential-algorithms",
        "infoeu-reposemanticsconferenceobject",
        "infoinfo-dscomputer-science-csdata-structures-and-algorithms-csds",
        "minimal-separators",
        "potential-maximal-cliques",
        "treewidth" ;
    dcat:landingPage <Proceedings%2031st%20International%20Colloquium%20on%20Automatas%2C%20Languages%20and%20Programming%20%28ICALP%202004%29> .

<Proceedings%2031st%20International%20Colloquium%20on%20Automatas%2C%20Languages%20and%20Programming%20%28ICALP%202004%29> a foaf:Document .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00085561v1/resource/e22f76e5-e5f1-4e0f-8d44-d3b953b30bfe> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-09T23:25:52.584910"^^xsd:dateTime ;
    dct:modified "2026-05-09T23:25:52.572163"^^xsd:dateTime ;
    dct:title "Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In" ;
    dcat:accessURL <https://hal.science/hal-00085561> .

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