A secret-sharing scheme realizes the forbidden graph access structure determined by a graph G = (V,E) if a pair of vertices can reconstruct the secret if and only if it is an edge in G. Secret-sharing schemes for forbidden graph access structures of bipartite graphs are equivalent to conditional disclosure of secrets protocols, a primitive that is used to construct attributed-based encryption s...

The computation required for a switching Kalman Filter (SKF) increases exponentially with the number of system operation modes. In this paper, computationally tractable graph representation is proposed linear dynamic (SLDS) along solution minimum-sum optimization problem clustering to reduce mode cardinality offline, before collecting measurements. It shown that upon perfect detection, induced ...

For two graphs J and H, the generalized Turán number, denoted by ex(n, J, H), is maximum number of copies in an H-free graph order n. A linear forest F disjoint union paths. In this paper, we determine $$ex(n,S_r,F)$$ when n large enough, which generalizes results on $$ex(n, S_r, P_k)$$ (k+1) P_2)$$ . Finally, prose a problem related to F-free under shifting operations.

In a (parameterized) graph edge modification problem, we are given G, an integer k and (usually well-structured) class $$\mathcal {G}$$ of graphs, asked whether it is possible to transform G into $$G' \in \mathcal by adding and/or removing at most edges. Parameterized problems received considerable attention in the last decades. this paper, focus on finding small kernels for problems. One studi...