Data Security Equals Graph Connectivity
From MaRDI portal
Publication:4875438
Recommendations
Cited in
(13)- Optimal augmentation for bipartite componentwise biconnectivity in linear time
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements
- Mathematical models for applying cell suppression methodology in statistical data protection.
- Smallest bipartite bridge-connectivity augmentation
- The bridge-connectivity augmentation problem with a partition constraint
- Lower-bounding procedures for the 2-dimensional cell suppression problem
- Fast exact algorithms for survivable network design with uniform requirements
- Spectral bounds for the connectivity of regular graphs with given order
- A Graph Theoretic Approach to Statistical Data Security
- A fast algorithm for cactus representations of minimum cuts
- Graph connectivity and its augmentation: Applications of MA orderings
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
- Minimal invariant sets in a vertex-weighted graph
This page was built for publication: Data Security Equals Graph Connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4875438)