Recommendations
Cites work
- A course in combinatorics.
- Families of \(k\)-independent sets
- On the upper bound of the size of the \(r\)-cover-free families
- Secure Overlay Network Design
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Tradeoffs in probabilistic packet marking for IP traceback
Cited in
(2)
This page was built for publication: Secure overlay network design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848639)