The following pages link to Adhesivity of polymatroids (Q2455572):
Displayed 13 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)
- Classes of matroids closed under minors and principal extensions (Q1786053) (← links)
- Finding lower bounds on the complexity of secret sharing schemes by linear programming (Q1949113) (← links)
- Secret sharing and duality (Q2033511) (← links)
- On abelian and homomorphic secret sharing schemes (Q2051370) (← links)
- A note on the connectivity of 2-polymatroid minors (Q2335691) (← links)
- Unavoidable minors for connected 2-polymatroids (Q2338642) (← links)
- A splitter theorem for 3-connected 2-polymatroids (Q2420565) (← links)
- Cyclic flats of a polymatroid (Q2660056) (← links)
- One-adhesive polymatroids (Q5858540) (← links)
- Secret sharing schemes for ports of matroids of rank 3 (Q5858541) (← links)