Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Secure overlay network design

From MaRDI portal
Publication:848639
Jump to:navigation, search

DOI10.1007/s00453-008-9198-7zbMath1184.68040OpenAlexW2058110973MaRDI QIDQ848639

Mohammad Mahdian, Li (Erran) Li, Vahab S. Mirrokni

Publication date: 4 March 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-008-9198-7


zbMATH Keywords

CombinatoricsOptimizationNetwork designNetwork security


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05)




Cites Work

  • Unnamed Item
  • On the upper bound of the size of the \(r\)-cover-free families
  • Families of \(k\)-independent sets
  • The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
  • Tradeoffs in probabilistic packet marking for IP traceback
  • Secure Overlay Network Design
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:848639&oldid=12790156"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 15:38.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki