Pages that link to "Item:Q2390949"
From MaRDI portal
The following pages link to On an infinite family of graphs with information ratio \(2 - 1/k\) (Q2390949):
Displaying 11 items.
- Optimal complexity of secret sharing schemes with four minimal qualified subsets (Q717150) (← links)
- On the optimization of bipartite secret sharing schemes (Q766238) (← links)
- An impossibility result on graph secret sharing (Q1039271) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
- On the information ratio of graphs without high-degree neighbors (Q2231745) (← links)
- Secret sharing on the \(d\)-dimensional cube (Q2260799) (← links)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs (Q2410257) (← links)
- Secret sharing on large girth graphs (Q2632835) (← links)
- Information Measures of Frequency Distributions with an Application to Labeled Graphs (Q2833050) (← links)
- On the Information Ratio of Graphs with Many Leaves (Q5234652) (← links)