Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Jaume Martí-Farré"'
Autor:
Jaume Martí-Farré, Anna de Mier
Publikováno v:
Discrete Mathematics. 346:113445
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29021ecd1d95af6544128aecfb7c38d3
https://doi.org/10.1016/j.disc.2023.113445
https://doi.org/10.1016/j.disc.2023.113445
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
Zero forcing is an iterative coloring process on a graph that has been widely used in such different areas as the modelling of propagation phenomena in networks and the study of minimum rank problems in matrices and graphs. This paper deals with zero
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2efd9b0734a84eab017ea5cfc972c841
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ A (simple) clutter is a family of pairwise incomparable subsets of a finite set . We say that a clutter is a domina
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c69a5d332b76f4a44ab9ae58db34f60
http://hdl.handle.net/2117/129817
http://hdl.handle.net/2117/129817
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
In the main part of this paper we present polynomial expressions for the cardinalities of some sets of interest of the nice distance-layer structure of the well-known De Bruijn and Kautz digraphs. More precisely, given a vertex v, let S i ⋆ (v) be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::811e67e2b5f2a464de1df77bdd242674
https://doi.org/10.1016/j.endm.2016.09.028
https://doi.org/10.1016/j.endm.2016.09.028
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
A dominating set of a graph is a vertex subset such that every vertexnot in the subset is adjacent to at least one in the subset. In this paper westudy whenever there exists a new dominating set contained (respectively,containing) the subset obtained
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::466c7b9afb547177c018b8678651e8b5
https://doi.org/10.7151/dmgt.2354
https://doi.org/10.7151/dmgt.2354
Publikováno v:
Designs, Codes and Cryptography. 61:167-186
The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. This paper deals with the open problem of optimizing this parameter for secret sharing schemes with general acces
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8346dce252c90a72c79c5e76f7ca216c
https://doi.org/10.1007/s10623-010-9446-0
https://doi.org/10.1007/s10623-010-9446-0
Autor:
Carles Padró, Jaume Martí-Farré
Publikováno v:
Designs, Codes and Cryptography. 52:1-14
One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. Brickell and Davenport proved that every one of these ideal access structures is related in a certain way to a unique ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::277096b9ffb4ad98dc09a5c62c7f90af
https://doi.org/10.1007/s10623-008-9264-9
https://doi.org/10.1007/s10623-008-9264-9
Autor:
Jorge Jiménez Urroz, Carles Padró, Ignacio Gracia, Vanesa Daza, Jaume Martí-Farré, Gregor Leander, Ronald Cramer
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
instname
Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c1d96fe53159e7c641ccdd737d78465
https://doi.org/10.1109/tit.2008.921692
https://doi.org/10.1109/tit.2008.921692
Autor:
Jaume Martí-Farré
Publikováno v:
Information Processing Letters. 102:133-137
A secret sharing scheme is a method which allows a secret to be shared among a set of participants in such a way that only qualified subsets of participants can recover the secret. The characterization of ideal access structures and the search for bo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3da5a7c4af5df2013e5866b65128f4a
https://doi.org/10.1016/j.ipl.2006.08.016
https://doi.org/10.1016/j.ipl.2006.08.016
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
The collection of the vertex dominating sets of a graph defines a hypergraph on the set of vertices of the graph. However, there are hypergraphs H that are not the collection of the vertex dominating sets of any graph. This paper deals with the quest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e64451c453b84a59f17842f1720f9806
https://hdl.handle.net/2117/81940
https://hdl.handle.net/2117/81940