IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v1y1997i2d10.1023_a1009712000657.html
   My bibliography  Save this article

Efficient Detection and Protection of Information in Cross Tabulated Tables II: Minimal Linear Invariants

Author

Listed:
  • Ming-Yang Kao

    (Duke University)

Abstract

To protect sensitive information in a cross tabulated table, it is acommon practice to suppress some of the cells. A linear combination of thesuppressed cells is called a linear invariant if it has a unique feasible value.Intuitively, the information contained in a linear invariant is not protectedbecause its value can be uniquely determined. Using a decomposition approach,this paper establishes a fundamental correspondence between linear invariantsof a table and edge cuts of a graph induced from the table. Thiscorrespondence is employed to give a linear-time algorithm for finding animportant class of linear invariants called therow or column linear invariants. In subsequent papers, thiscorrespondence is used to solve via graph theoretic techniques a wide varietyof problems for protecting information in a table.

Suggested Citation

  • Ming-Yang Kao, 1997. "Efficient Detection and Protection of Information in Cross Tabulated Tables II: Minimal Linear Invariants," Journal of Combinatorial Optimization, Springer, vol. 1(2), pages 187-202, June.
    • Handle: RePEc:spr:jcomop:v:1:y:1997:i:2:d:10.1023_a:1009712000657
    DOI: 10.1023/A:1009712000657
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009712000657
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009712000657?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ming-Yang Kao & Neill Occhiogrosso & Shang-Hua Teng, 1998. "Simple and Efficient Graph Compression Schemes for Dense and Complement Graphs," Journal of Combinatorial Optimization, Springer, vol. 2(4), pages 351-359, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:1:y:1997:i:2:d:10.1023_a:1009712000657. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.