… be shared, generally in the form of social or Internet graphs, … to improve privacy on graphs
only target specific attacks, and … Our work seeks a solution to share meaningful graph datasets …

… , the unique proper unshared graph that the unfolding partial order … sharing graph and the
reductions of its least-shared-instance, we prove that the read-back of a proper sharing graph …

… We develop the models of sharing graphs, also known as term graphs, in terms … sharing,
we consider four situations of sharing graphs. The simplest is first-order acyclic sharing graphs …

… a study of secret sharing schemes for.access structures based on graphs. Given a graph G,
we … how much information in being distributed as shares compared with the size of the secret …

… graph “hard” for secret-sharing schemes (that is, they require large shares), we study very
dense graphs, that is, graphs … We show that if a graph with \(n\) vertices contains \(\left( {\begin{…

… perfect secret sharing scheme is, then connect it to certain submodular function. Let G be a
graph, … A covering of the graph G is a collection of subgraphs of G such that every edge of G is …

… In this section we present the series of steps we performed to reduce the graph to a core
subset for which shared interests could be effectively deduced. These transformations will be …

… methods to capture commonly shared knowledge and learn a generalized encoder. From
real-world graph datasets, we observe that some structural properties are shared by various …

… The current paper follows up on a suggestion by Elizabeth Thompson that genetic descent
graphs offer a more appropriate space for executing a Markov chain. A descent graph …

… , we improve the total share size for all very dense graphs. … graph there is a scheme with
normalized maximum share size \… all graphs a secret-sharing scheme with maximum share size \(…