Data Security Equals Graph Connectivity

DOI10.1137/S0895480193243274zbMath0841.68056OpenAlexW2065170767WikidataQ113434310 ScholiaQ113434310MaRDI QIDQ4875438

Ming-Yang Kao

Publication date: 2 July 1996

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480193243274

zbMATH Keywords

data securitycross-tabulated table

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Graph theory (05C99) Connectivity (05C40) Distributed algorithms (68W15)

Related Items (11)

Spectral Bounds for the Connectivity of Regular Graphs with Given Order ⋮ Smallest bipartite bridge-connectivity augmentation ⋮ Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs ⋮ Mathematical models for applying cell suppression methodology in statistical data protection. ⋮ Multigraph augmentation under biconnectivity and general edge-connectivity requirements ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ A fast algorithm for cactus representations of minimum cuts ⋮ The bridge-connectivity augmentation problem with a partition constraint ⋮ Minimal invariant sets in a vertex-weighted graph ⋮ Fast exact algorithms for survivable network design with uniform requirements ⋮ Lower-bounding procedures for the 2-dimensional cell suppression problem

This page was built for publication: Data Security Equals Graph Connectivity