A Graph Theoretic Approach to Statistical Data Security
From MaRDI portal
Publication:3799808
DOI10.1137/0217034zbMath0653.90039OpenAlexW2067372123WikidataQ113434312 ScholiaQ113434312MaRDI QIDQ3799808
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
linear time algorithmcomputational graph theoryprotecting sensitive datasensitive celltwo-dimensional table of statisticsunprotected cellsworst case times
Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Operations research and management science (90B99) Theory of software (68N99)
Related Items (17)
Smallest bipartite bridge-connectivity augmentation ⋮ On enumerating all minimal solutions of feedback problems ⋮ Feedback vertex sets on restricted bipartite graphs ⋮ Optimal bi-level augmentation for selective! enhancing graph connectivity with applications ⋮ On properties of multi-dimensional statistical tables ⋮ Mathematical models for applying cell suppression methodology in statistical data protection. ⋮ Markov bases of three-way tables are arbitrarily complicated ⋮ Two Hardness Results on Feedback Vertex Sets ⋮ The bridge-connectivity augmentation problem with a partition constraint ⋮ Optimal augmentation for bipartite componentwise biconnectivity in linear time ⋮ Exact disclosure prevention in two-dimensional statistical tables ⋮ An efficient algorithm for minimum feedback vertex sets in rotator graphs ⋮ Minimal invariant sets in a vertex-weighted graph ⋮ Fast exact algorithms for survivable network design with uniform requirements ⋮ The controlled rounding problem: Complexity and computational experience ⋮ Lower-bounding procedures for the 2-dimensional cell suppression problem ⋮ On the computational complexity of reconstructing lattice sets from their \(X\)-rays
This page was built for publication: A Graph Theoretic Approach to Statistical Data Security
