@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-00773343v4> a dcat:Dataset ;
    dct:description """
              We consider the problem of reliably broadcasting information in a multihop asynchronous network in the presence of Byzantine failures: some nodes may exhibit unpredictable malicious behavior. We focus on completely decentralized solutions. Few Byzantine-robust algorithms exist for loosely connected networks. A recent solution guarantees reliable broadcast on a torus when D > 4, D being the minimal distance between two Byzantine nodes. In this paper, we generalize this result to 4-connected planar graphs. We show that reliable broadcast can be guaranteed when D > Z, Z being the maximal number of edges per polygon. We also show that this bound on D is a lower bound for this class of graphs. Our solution has the same time complexity as a simple broadcast. This is also the first solution where the memory required increases linearly (instead of exponentially) with the size of transmitted information. Important disclaimer: these results have NOT yet been published in an international conference or journal. This is just a technical report presenting intermediary and incomplete results. A generalized version of these results may be under submission.
            """ ;
    dct:identifier "hal-00773343" ;
    dct:issued "2026-05-07T22:03:56.138834"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-07T22:03:56.138839"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "On Byzantine Broadcast in Planar Graphs" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00773343v4/resource/637bed89-1f68-467a-991d-e3dac3b547b9> ;
    dcat:keyword "broadcast",
        "byzantine-failures",
        "distributed-computing",
        "fault-tolerance",
        "infoeu-reposemanticsreport",
        "infoinfo-crcomputer-science-cscryptography-and-security-cscr",
        "infoinfo-dccomputer-science-csdistributed-parallel-and-cluster-computing-csdc",
        "infoinfo-dscomputer-science-csdata-structures-and-algorithms-csds",
        "infoinfo-nicomputer-science-csnetworking-and-internet-architecture-csni",
        "networks",
        "protocol",
        "reports" ;
    dcat:landingPage <https://hal.sorbonne-universite.fr/hal-00773343> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00773343v4/resource/637bed89-1f68-467a-991d-e3dac3b547b9> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-07T22:03:56.144288"^^xsd:dateTime ;
    dct:modified "2026-05-07T22:03:56.123968"^^xsd:dateTime ;
    dct:title "On Byzantine Broadcast in Planar Graphs" ;
    dcat:accessURL <https://hal.sorbonne-universite.fr/hal-00773343> .

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

<https://hal.sorbonne-universite.fr/hal-00773343> a foaf:Document .