Minimal invariant sets in a vertex-weighted graph

DOI10.1016/j.tcs.2006.06.005zbMath1100.68082MaRDI QIDQ2508971

Mauro Mezzini, Marina Moscarini, Francesco Mario Malvestuto

Publication date: 20 October 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.06.005

zbMATH Keywords

invariant set; algebraic set

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

Related Items

An analytical approach to the inference of summary data of additive type

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalizations of magic graphs
• Magic graphs, a characterization
• Efficient detection and protection of information in cross tabulated tables. II: Minimal linear invariants
• On the content of materialized aggregate views
• 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
• Some New Matroids on Graphs: Cut Sets and the Max Cut Problem
• A Graph Theoretic Approach to Statistical Data Security
• Auditing and Inference Control in Statistical Databases
• Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables
• Data Security Equals Graph Connectivity
• Answering queries using views: A survey