Skip to main content
SpringerLink
Log in

Exclusive Graph Searching

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

This paper tackles the well known graph searching problem, where a team of searchers aims at capturing an intruder in a network, modeled as a graph. This problem has been mainly studied for its relationship with the pathwidth of graphs. All variants of this problem assume that any node can be simultaneously occupied by several searchers. This assumption may be unrealistic, e.g., in the case of searchers modeling physical searchers, or may require each individual node to provide additional resources, e.g., in the case of searchers modeling software agents. We thus introduce and investigate exclusive graph searching, in which no two or more searchers can occupy the same node at the same time. As for the classical variants of graph searching, we study the minimum number of searchers required to capture the intruder. This number is called the exclusive search number of the considered graph. Exclusive graph searching appears to be considerably more complex than classical graph searching, for at least two reasons: (1) it does not satisfy the monotonicity property, and (2) it is not closed under minor. Moreover, we observe that the exclusive search number of a tree may differ exponentially from the values of classical search numbers (e.g., pathwidth). Nevertheless, we design a polynomial-time algorithm which, given any n-node tree T, computes the exclusive search number of T in time \(O(n^3)\). Moreover, for any integer k, we provide a characterization of the trees T with exclusive search number at most k. Finally, we prove that the ratio between the exclusive search number and the pathwidth of a graph is bounded by its maximum degree.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

Notes

  1. Note that, whenever exclusivity is not required, internality is not a strong constraint (difficult to overcome), since the jumping of one searcher from a node u to a node v can be replaced by sliding this searcher along a path from u to v. However, the combination of exclusivity and internality makes the problem much more difficult.

  2. That is, \(s_i\) consists in either placing a searcher at a node of \(V(G) \setminus V(H)\), or removing a searcher from a node of \(V(G) \setminus V(H)\), or sliding a searcher along an edge in \(\{u,v\} \in E(G)\) where \(u,v \in V(G) \setminus V(H)\)

  3. This constraint is only to avoid considering pathological cases when a sequence \({\mathcal {S}}\) starts from a state (I, F) and some edges of F are recontaminated before the first move of \({\mathcal {S}}\).

  4. If \(|V(R^1)|< k-1\), then the strategy starts by placing one searcher at \(u_1\), then as much as possible searchers at the nodes of \(R^1\), then at the nodes of \(T^1_1\), of \(T^1_2\), and so on, until the k searchers are placed.

References

  1. Barrière, L., Flocchini, P., Fomin, F.V., Fraigniaud, P., Nisse, N., Santoro, N., Thilikos, D.M.: Connected graph searching. Inf. Comput. 219, 1–16 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bienstock, D.: Graph searching, path-width, tree-width and related problems (a survey). DIMACS Ser. Discret Math. Theor. Comput. Sci. 5, 33–49 (1991)

    MathSciNet  MATH  Google Scholar 

  3. Bienstock, D., Seymour, P.D.: Monotonicity in graph searching. J. Algorithms 12(2), 239–245 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Blin, L., Burman, J., Nisse, N.: Exclusive graph searching. In: 21st Annual European Symposium on Algorithms (ESA), vol. 8125 of Lecture Notes in Computer Science, pp. 181–192. Springer (2013)

  5. Breisch, R.L.: An intuitive approach to speleotopology. Southwest. Cavers 6, 72–78 (1967)

    Google Scholar 

  6. Breisch, R.L.: Lost in a Cave-Applying Graph Theory to Cave Exploration. National Speleological Society, Alabama (2012)

    Google Scholar 

  7. Dereniowski, D.: From pathwidth to connected pathwidth. SIAM J. Discrete Math. 26(4), 1709–1732 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  8. Ellis, J.A., Sudborough, I.H., Turner, J.S.: The vertex separation and search number of a graph. Inf. Comput. 113(1), 50–79 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fomin, F.V., Heggernes, P., Mihai, R.: Mixed search number and linear-width of interval and split graphs. Networks 56(3), 207–214 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3), 236–245 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  11. Golovach, P.A., Heggernes, P., Mihai, R.: Edge search number of cographs. Discrete Appl. Math. 160(6), 734–743 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kirousis, L.M., Papadimitriou, C.H.: Searching and pebbling. Theoret. Comput. Sci. 47(2), 205–218 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  13. Markou, E., Nisse, N., Pérennes, S.: Exclusive Graph Searching vs. Pathwidth. Research Report RR-8523, INRIA (2014)

  14. Megiddo, N., Hakimi, S.L., Garey, M.R., Johnson, D.S., Papadimitriou, C.H.: The complexity of searching a graph. J. Assoc. Comput. Mach. 35(1), 18–44 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  15. Parsons, T.D.: The search number of a connected graph. In: 9th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Congress. Numer., XXI, pp. 549–554, Winnipeg. Utilitas Math (1978)

  16. Peng, S.-L., Ho, C.-W., Hsu, T-s, Ko, M.-T., Tang, C.Y.: Edge and node searching problems on trees. Theoret. Comput. Sci. 240(2), 429–446 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  17. Skodinis, K.: Computing optimal linear layouts of trees in linear time. J. Algorithms 47(1), 40–59 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Suchan, K., Todinca, I.: Pathwidth of circular-arc graphs. In: 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG), vol. 4769 of LNCS, pp. 258–269. Springer (2007)

  19. Yang, B., Dyer, D., Alspach, B.: Sweeping graphs with large clique number. Discrete Math. 309(18), 5770–5780 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, Sorbonne Universités, UPMC Univ Paris 06, Paris, France

    Lélia Blin

  2. Université d’Evry-Val-d’Essonne, Evry, France

    Lélia Blin

  3. LIP6 UMR 7606, 4 place Jussieu, 75005, Paris, France

    Lélia Blin

  4. LRI, CNRS, UMR-8623, Université Paris Sud, Orsay, France

    Janna Burman

  5. Inria, Sophia Antipolis, France

    Nicolas Nisse

  6. Univ. Nice Sophia Antipolis, CNRS, I3S, UMR 7271, Sophia Antipolis, France

    Nicolas Nisse

Authors
  1. Lélia Blin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Janna Burman
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Nicolas Nisse
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lélia Blin.

Additional information

An extended abstract of this work has been presented in ESA 2013 [4].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Blin, L., Burman, J. & Nisse, N. Exclusive Graph Searching. Algorithmica 77, 942–969 (2017). https://doi.org/10.1007/s00453-016-0124-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-016-0124-0

Keywords

Search

Navigation