Journal article Open Access
<?xml version='1.0' encoding='utf-8'?> <rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:adms="http://www.w3.org/ns/adms#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dct="http://purl.org/dc/terms/" xmlns:dctype="http://purl.org/dc/dcmitype/" xmlns:dcat="http://www.w3.org/ns/dcat#" xmlns:duv="http://www.w3.org/ns/duv#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:frapo="http://purl.org/cerif/frapo/" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:gsp="http://www.opengis.net/ont/geosparql#" xmlns:locn="http://www.w3.org/ns/locn#" xmlns:org="http://www.w3.org/ns/org#" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:prov="http://www.w3.org/ns/prov#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:schema="http://schema.org/" xmlns:skos="http://www.w3.org/2004/02/skos/core#" xmlns:vcard="http://www.w3.org/2006/vcard/ns#" xmlns:wdrs="http://www.w3.org/2007/05/powder-s#"> <rdf:Description rdf:about="https://zenodo.org/record/3532849"> <rdf:type rdf:resource="http://www.w3.org/ns/dcat#Dataset"/> <dct:type rdf:resource="http://purl.org/dc/dcmitype/Text"/> <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://zenodo.org/record/3532849</dct:identifier> <foaf:page rdf:resource="https://zenodo.org/record/3532849"/> <dct:creator> <rdf:Description rdf:about="http://orcid.org/0000-0002-0996-8769"> <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/> <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#string">0000-0002-0996-8769</dct:identifier> <foaf:name>Miklós Bartha</foaf:name> <org:memberOf> <foaf:Organization> <foaf:name>Department of Computer Science, Memorial University of Newfoundland</foaf:name> </foaf:Organization> </org:memberOf> </rdf:Description> </dct:creator> <dct:creator> <rdf:Description> <rdf:type rdf:resource="http://xmlns.com/foaf/0.1/Agent"/> <foaf:name>Miklós Krész</foaf:name> <org:memberOf> <foaf:Organization> <foaf:name>InnoRenew CoE; University of Primorska; University of Szeged</foaf:name> </foaf:Organization> </org:memberOf> </rdf:Description> </dct:creator> <dct:title>On the König deficiency of zero-reducible graphs</dct:title> <dct:publisher> <foaf:Agent> <foaf:name>Zenodo</foaf:name> </foaf:Agent> </dct:publisher> <dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#gYear">2019</dct:issued> <dcat:keyword>Graph matching</dcat:keyword> <dcat:keyword>Independent set</dcat:keyword> <dcat:keyword>König property</dcat:keyword> <dcat:keyword>Graph reduction</dcat:keyword> <dcat:keyword>Graph algorithm</dcat:keyword> <frapo:isFundedBy rdf:resource="info:eu-repo/grantAgreement/EC/H2020/739574/"/> <schema:funder> <foaf:Organization> <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#string">10.13039/501100000780</dct:identifier> <foaf:name>European Commission</foaf:name> </foaf:Organization> </schema:funder> <dct:issued rdf:datatype="http://www.w3.org/2001/XMLSchema#date">2019-11-06</dct:issued> <owl:sameAs rdf:resource="http://issn.org/resource/ISSN/1382-6905"/> <adms:identifier> <adms:Identifier> <skos:notation rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">http://issn.org/resource/ISSN/1382-6905</skos:notation> <adms:schemeAgency>issn</adms:schemeAgency> </adms:Identifier> </adms:identifier> <owl:sameAs rdf:resource="https://zenodo.org/record/3532849"/> <adms:identifier> <adms:Identifier> <skos:notation rdf:datatype="http://www.w3.org/2001/XMLSchema#anyURI">https://zenodo.org/record/3532849</skos:notation> <adms:schemeAgency>url</adms:schemeAgency> </adms:Identifier> </adms:identifier> <owl:sameAs rdf:resource="https://doi.org/10.1007/s10878-019-00466-2"/> <dct:isPartOf rdf:resource="https://zenodo.org/communities/innorenew"/> <dct:description><p>A confluent and terminating reduction system is introduced for graphs,which preserves the number of their perfect matchings. A union-find algorithm is presented to carry out reduction in almost linear time. The K&ouml;nig property is investigated in the context of reduction by introducing the K&ouml;nig deficiency of a graph G as the difference between the vertex covering number and thematching number ofG. It is shown that the problem of finding the K&ouml;nig deficiency of a graph is NP-complete even if we know that the graph reduces to the empty graph. Finally, the K&ouml;nig deficiency of graphs G having a vertex v such that G &minus; v has a unique perfect matching is studied in connection with reduction.</p></dct:description> <dct:accessRights rdf:resource="http://publications.europa.eu/resource/authority/access-right/PUBLIC"/> <dct:accessRights> <dct:RightsStatement rdf:about="info:eu-repo/semantics/openAccess"> <rdfs:label>Open Access</rdfs:label> </dct:RightsStatement> </dct:accessRights> <dcat:distribution> <dcat:Distribution> <dct:license rdf:resource="https://creativecommons.org/licenses/by/4.0/legalcode"/> <dcat:accessURL rdf:resource="https://zenodo.org/record/3532849"/> </dcat:Distribution> </dcat:distribution> <dcat:distribution> <dcat:Distribution> <dcat:accessURL>https://doi.org/10.1007/s10878-019-00466-2</dcat:accessURL> <dcat:byteSize>621910</dcat:byteSize> <dcat:downloadURL>https://zenodo.org/record/3532849/files/Bartha-Krész2019_Article_OnTheKönigDeficiencyOfZero-red.pdf</dcat:downloadURL> <dcat:mediaType>application/pdf</dcat:mediaType> </dcat:Distribution> </dcat:distribution> </rdf:Description> <foaf:Project rdf:about="info:eu-repo/grantAgreement/EC/H2020/739574/"> <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#string">739574</dct:identifier> <dct:title>Renewable materials and healthy environments research and innovation centre of excellence</dct:title> <frapo:isAwardedBy> <foaf:Organization> <dct:identifier rdf:datatype="http://www.w3.org/2001/XMLSchema#string">10.13039/501100000780</dct:identifier> <foaf:name>European Commission</foaf:name> </foaf:Organization> </frapo:isAwardedBy> </foaf:Project> </rdf:RDF>
Views | 71 |
Downloads | 90 |
Data volume | 56.0 MB |
Unique views | 67 |
Unique downloads | 88 |