ICDT '03 Proceedings of the 9th International Conference on Database Theory
Privacy in multidimensional databases
Multidimensional databases
Auditing sum-queries to make a statistical database secure
ACM Transactions on Information and System Security (TISSEC)
Minimal invariant sets in a vertex-weighted graph
Theoretical Computer Science
An analytical approach to the inference of summary data of additive type
Theoretical Computer Science
| Hi-index | 0.01 |
Given an edge-weighted graph where all weights are nonnegative reals, an edge reweighting is an assignment of nonnegative reals to edges such that, for each vertex, the sums of given and new weights assigned to the edges incident on the vertex do coincide. An edge is then said to be invariant if its weight is the same for any edge reweighting. We show that the set of invariant edges of an arbitrary edge-weighted graph can be determined in time linear in the size of the underlying graph. Moreover, an application to the security of statistical data is discussed.