IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v38y2019i1d10.1007_s10878-019-00379-0.html
   My bibliography  Save this article

Non-adaptive group testing on graphs with connectivity

Author

Listed:
  • Song Luo

    (University of Tsukuba)

  • Yuji Matsuura

    (University of Tsukuba)

  • Ying Miao

    (University of Tsukuba)

  • Maiko Shigeno

    (University of Tsukuba)

Abstract

Group testing refers to any procedure which groups arbitrary subsets of items into pools, and then tests each pool to identify the “sparse” defective items. This paper focuses on a probing scheme in non-adaptive group testing with graph-based constraints. Assume that all nodes function properly but there is at most one failed edge in an undirected graph. By sending probing signals in diagnosis process, we try to know if there is any edge failed, and if there is, to identify the failed edge. Each probing set is allowed only if the induced subgraph by the set is connected. The objective of this model is to identify the failed edge by the fewest possible probes. This paper gives a deterministic optimal probing scheme for complete graphs, and an essentially optimal probing scheme for torus grid graphs.

Suggested Citation

  • Song Luo & Yuji Matsuura & Ying Miao & Maiko Shigeno, 2019. "Non-adaptive group testing on graphs with connectivity," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 278-291, July.
    • Handle: RePEc:spr:jcomop:v:38:y:2019:i:1:d:10.1007_s10878-019-00379-0
    DOI: 10.1007/s10878-019-00379-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-019-00379-0
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-019-00379-0?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.

    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:38:y:2019:i:1:d:10.1007_s10878-019-00379-0. 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.