A Linear Time Algorithm for Edge Searching on 3-Cycle-Disjoint Graphs

被引：0
|
作者：
Yang, Boting [1 ]
Zhang, Runtao [1 ]
Cao, Yi [1 ]
机构：
[1] Univ Regina, Dept Comp Sci, Regina, SK S4S 0A2, Canada
来源：
OPERATIONS RESEARCH AND ITS APPLICATIONS | 2010年 / 12卷
关键词：
graph searching; edge searching; cycle-disjoint graphs; VERTEX SEPARATION; PATHWIDTH;
D O I：
暂无
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The edge searching problem is to find the minimum number of searchers to capture an intruder that is hiding on vertices or edges of a graph. A 3-cycle-disjoint graph is a connected graph in which no pair of cycles share a vertex and every cycle has at most three vertices with degree more than two. In this paper, we consider the edge searching problem on 3-cycle-disjoint graphs. We propose a linear time algorithm to compute the edge search number and the optimal edge search strategy of a 3-cycle-disjoint graph.
引用
收藏
页码：225 / 232
页数：8
相关论文
共 50 条
12345