Digraph searching, directed vertex separation and directed pathwidth

Authors:
Boting Yang;Yi Cao
Affiliations:
Department of Computer Science, University of Regina, Canada;Department of Computer Science, University of Regina, Canada
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 18
Cited 4

Searching and pebbling

Theoretical Computer Science
The complexity of searching a graph

Journal of the ACM (JACM)
Monotonicity in graph searching

Journal of Algorithms
The vertex separation number of a graph equals its path-width

Information Processing Letters
Recontamination does not help to search a graph

Journal of the ACM (JACM)
Graph searching and a min-max theorem for tree-width

Journal of Combinatorial Theory Series B
The vertex separation and search number of a graph

Information and Computation
Helicopter search problems, bandwidth and pathwidth

Discrete Applied Mathematics
Algorithms and obstructions for linear-width and related search parameters

Discrete Applied Mathematics
Graph Searching and Interval Completion

SIAM Journal on Discrete Mathematics
Directed tree-width

Journal of Combinatorial Theory Series B
DAG-width: connectivity measure for directed graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Directed tree-width examples

Journal of Combinatorial Theory Series B
Digraph measures: Kelly decompositions, games, and orderings

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Digraph Strong Searching: Monotonicity and Complexity

AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Directed searching digraphs: monotonicity and complexity

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
DAG-Width and parity games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
D-Width: a more natural measure for directed tree width

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

On the Monotonicity of Weak Searching

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Monotonicity in digraph search problems

Theoretical Computer Science
A polynomial time algorithm for bounded directed pathwidth

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Computing directed pathwidth in O(1.89n) time

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation

Quantified Score

Hi-index	0.05

Visualization

Abstract

The four digraph search models, directed search, undirected search, strong search, and weak search, are studied in this paper. There are three types of actions for searchers in these models: placing, removing, and sliding. The four models differ in the abilities of searchers and intruders depending on whether or not they must obey the edge directions when they move along the directed edges. In this paper, we investigate the relationships between these search models. We introduce the concept of directed vertex separation for digraphs. We also discuss the properties of directed vertex separation, and investigate the relations between directed vertex separation, directed pathwidth and search numbers in different search models.