A Graph Theoretic Approach to Statistical Data Security

DOI10.1137/0217034MaRDI QIDQ3799808zbMATH OpenOpenAlexWikidataFDO

Authors Dan Gusfield

Publication date 1988

Published in SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

computational graph theorylinear time algorithmprotecting sensitive datasensitive celltwo-dimensional table of statisticsunprotected cellsworst case times

Mathematics Subject Classification ID

Theory of software (68N99) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Operations research and management science (90B99)

Recommendations

• Data Security Equals Graph Connectivity
• Efficient detection and protection of information in cross tabulated tables. II: Minimal linear invariants
• Mathematical models for applying cell suppression methodology in statistical data protection.
• Models and algorithms for the 2-dimensional cell suppression problem in statistical disclosure control
• Solving the cell suppression problem on tabular data with linear constraints

Cited in

(26)

• The controlled rounding problem: Complexity and computational experience
• On the computational complexity of reconstructing lattice sets from their X-rays
• On enumerating all minimal solutions of feedback problems
• Efficient detection and protection of information in cross tabulated tables. II: Minimal linear invariants
• On properties of multi-dimensional statistical tables
• Mathematical models for applying cell suppression methodology in statistical data protection.
• Lower-bounding procedures for the 2-dimensional cell suppression problem
• Exact disclosure prevention in two-dimensional statistical tables
• Markov bases of three-way tables are arbitrarily complicated
• Minimal invariant sets in a vertex-weighted graph
• Two Hardness Results on Feedback Vertex Sets
• Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test
• A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
• Rapid calculation of exact cell bounds for contingency tables from conditional frequencies
• Feedback vertex sets on restricted bipartite graphs
• Three-dimensional Statistical Data Security Problems
• scientific article; zbMATH DE number 1161287 (Why is no real title available?)
• scientific article; zbMATH DE number 2087727 (Why is no real title available?)
• scientific article; zbMATH DE number 759639 (Why is no real title available?)
• Data Security Equals Graph Connectivity
• Fast exact algorithms for survivable network design with uniform requirements
• Optimal bi-level augmentation for selective! enhancing graph connectivity with applications
• Optimal augmentation for bipartite componentwise biconnectivity in linear time
• Smallest bipartite bridge-connectivity augmentation
• The bridge-connectivity augmentation problem with a partition constraint
• An efficient algorithm for minimum feedback vertex sets in rotator graphs

This page was built for publication: A Graph Theoretic Approach to Statistical Data Security

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