@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-00875532v1> a dcat:Dataset ;
    dct:description """
              Given a bipartite graph G = (U υ V,E) such that |U| = |V | and every edge is labelled true or false or both, the perfect matching free subgraph problem is to determine whether or not there exists a subgraph of G containing, for each node u of U, either all the edges labelled true or all the edges labelled false incident to u, and which does not contain a perfect matching. This problem arises in the structural analysis of differential-algebraic systems. The purpose of this paper is to show that this problem is NP-complete. We show that the problem is equivalent to the stable set problem in a restricted case of tripartite graphs. Then we show that the latter remains NP-complete in that case. We also prove the NP-completeness of the related minimum blocker problem in bipartite graphs with perfect matching.
            """ ;
    dct:identifier "hal-00875532" ;
    dct:issued "2026-05-09T07:11:22.059169"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-09T07:11:22.059172"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "On the NP-Completeness of the Perfect Perfect Matching Free Subgraph Problem" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00875532v1/resource/bb38123a-f68f-42f6-8392-72698f26b03e> ;
    dcat:keyword "bipartite-graph",
        "blocker",
        "infoeu-reposemanticspreprint",
        "infoinfo-cccomputer-science-cscomputational-complexity-cscc",
        "infoinfo-dmcomputer-science-csdiscrete-mathematics-csdm",
        "infoinfo-rocomputer-science-csoperations-research-mathoc",
        "matchng",
        "np-complete",
        "preprints-working-papers-",
        "stable-set",
        "structural-analysis-problem",
        "tripartite-graph" ;
    dcat:landingPage <https://hal.science/hal-00875532> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00875532v1/resource/bb38123a-f68f-42f6-8392-72698f26b03e> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-09T07:11:22.060447"^^xsd:dateTime ;
    dct:modified "2026-05-09T07:11:22.044254"^^xsd:dateTime ;
    dct:title "On the NP-Completeness of the Perfect Perfect Matching Free Subgraph Problem" ;
    dcat:accessURL <https://hal.science/hal-00875532> .

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

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