NDLI: Exclusive Graph Searching

Content Provider	Springer Nature Link
Author	Blin, Lélia Burman, Janna Nisse, Nicolas
Copyright Year	2016
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.
Starting Page	942
Ending Page	969
Page Count	28
File Format	PDF
ISSN	01784617
Journal	Algorithmica
Volume Number	77
Issue Number	3
e-ISSN	14320541
Language	English
Publisher	Springer US
Publisher Date	2016-02-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Graph searching Pathwidth Trees Exclusivity Algorithm Analysis and Problem Complexity Theory of Computation Mathematics of Computing Algorithms Computer Systems Organization and Communication Networks Data Structures, Cryptology and Information Theory
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Nondeterministic Graph Searching: From Pathwidth to Treewidth

Computing Directed Pathwidth in $$O(1.89^{n})$$ Time

A Distributed Algorithm for Computing the Node Search Number in Trees

Graph Searching, Elimination Trees, and a Generalization of Bandwidth

Planar Graph Blocking for External Searching

Improved Approximation Algorithms for the Average-Case Tree Searching Problem

An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion

Biased Range Trees

An Approximation Algorithm for Binary Searching in Trees

Exclusive Graph Searching

Similar Documents

Nondeterministic Graph Searching: From Pathwidth to Treewidth

Computing Directed Pathwidth in $$O(1.89^{n})$$ Time

A Distributed Algorithm for Computing the Node Search Number in Trees

Graph Searching, Elimination Trees, and a Generalization of Bandwidth

Planar Graph Blocking for External Searching

Improved Approximation Algorithms for the Average-Case Tree Searching Problem

An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion

Biased Range Trees

An Approximation Algorithm for Binary Searching in Trees

Exclusive Graph Searching