Union of random minkowski sums and network vulnerability analysis

DOI10.1145/2462356.2462398MaRDI QIDQ5174476zbMATH OpenOpenAlexWikidataFDO

Authors Haim Kaplan, Pankaj K. Agarwal, Micha Sharir

Publication date 17 February 2015

Published in Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.638.9959

zbMATH Keywords

arrangementsnetwork analysisunion complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Union of random Minkowski sums and network vulnerability analysis
• scientific article; zbMATH DE number 961960
• Bound and exact methods for assessing link vulnerability in complex networks
• Efficiency and vulnerability analysis for congested networks with random data
• On vulnerability measures of networks
• On the probability of facing random breakdowns: a measure of networks' vulnerability
• Asymptotic estimates for efficiency, vulnerability and cost for random networks
• Network robustness and random processes
• Vulnerability of networks of interacting Markov chains

Cited in

(2)

• On the complexity of randomly weighted multiplicative Voronoi diagrams
• Union of random Minkowski sums and network vulnerability analysis

This page was built for publication: Union of random minkowski sums and network vulnerability analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5174476)