Pages that link to "Item:Q3799808"
From MaRDI portal
The following pages link to A Graph Theoretic Approach to Statistical Data Security (Q3799808):
Displaying 16 items.
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Smallest bipartite bridge-connectivity augmentation (Q834588) (← links)
- The bridge-connectivity augmentation problem with a partition constraint (Q982661) (← links)
- An efficient algorithm for minimum feedback vertex sets in rotator graphs (Q987789) (← links)
- The controlled rounding problem: Complexity and computational experience (Q1261381) (← links)
- On the computational complexity of reconstructing lattice sets from their \(X\)-rays (Q1301705) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- On properties of multi-dimensional statistical tables (Q1410284) (← links)
- Mathematical models for applying cell suppression methodology in statistical data protection. (Q1420457) (← links)
- Lower-bounding procedures for the 2-dimensional cell suppression problem (Q1577137) (← links)
- Exact disclosure prevention in two-dimensional statistical tables (Q1781566) (← links)
- Markov bases of three-way tables are arbitrarily complicated (Q2457324) (← links)
- Minimal invariant sets in a vertex-weighted graph (Q2508971) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- Fast exact algorithms for survivable network design with uniform requirements (Q5918784) (← links)
- Optimal augmentation for bipartite componentwise biconnectivity in linear time (Q6487441) (← links)
