Data Security Equals Graph Connectivity

DOI10.1137/S0895480193243274MaRDI QIDQ4875438zbMATH OpenOpenAlexWikidataFDO

Authors 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) Connectivity (05C40) Distributed algorithms (68W15) Graph theory (05C99)

Recommendations

• A Graph Theoretic Approach to Statistical Data Security
• Efficient detection and protection of information in cross tabulated tables. II: Minimal linear invariants
• Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables
• scientific article; zbMATH DE number 1414300

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)