A new simple strategy into edge-searching of a graph, which is useful to the various subgraph listing problems, is introduced, and an upper bound on $a(G)$ is established for a graph $G:a (G) \leqq \lceil (2m + n)^{1/2} \rceil $, where n is the number of vertices in G.Expand

This paper shows that by providing the trustees with several information data concerning the distributed information of the (k, n) threshold method, any access structure can be realized.Expand

The first polynomial-time algorithm to solve the three problems for arbitrary trees, which are NP-hard even for series-parallel graphs, but are solvable in linear time for paths.Expand