Minimal invariant sets in a vertex-weighted graph
From MaRDI portal
Publication:2508971
Recommendations
- A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
- Weighted graphs with fixed vertex degrees and network flows
- Local Structure When All Maximal Independent Sets Have Equal Weight
- Stable structure on safe set problems in vertex-weighted graphs
- Invariant sets of arcs in network flow problems
Cites work
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- A Graph Theoretic Approach to Statistical Data Security
- A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
- Answering queries using views: A survey
- Auditing and Inference Control in Statistical Databases
- Data Security Equals Graph Connectivity
- Efficient Detection and Protection of Information in Cross Tabulated Tables I: Linear Invariant Test
- Efficient detection and protection of information in cross tabulated tables. II: Minimal linear invariants
- Generalizations of magic graphs
- Graph theory
- Magic graphs, a characterization
- Network flows. Theory, algorithms, and applications.
- On the content of materialized aggregate views
- Some New Matroids on Graphs: Cut Sets and the Max Cut Problem
- Total Protection of Analytic-Invariant Information in Cross-Tabulated Tables
Cited in
(7)- scientific article; zbMATH DE number 1057880 (Why is no real title available?)
- An analytical approach to the inference of summary data of additive type
- On a minor-monotone graph invariant
- A Linear Algorithm for Finding the Invariant Edges of an Edge-Weighted Graph
- MINORS IN WEIGHTED GRAPHS
- Invariant sets of arcs in network flow problems
- Invariant \(K\)-minimal sets in the discrete and continuous settings
This page was built for publication: Minimal invariant sets in a vertex-weighted graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2508971)
