کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
418963 | 681728 | 2008 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Digraph searching, directed vertex separation and directed pathwidth
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Digraph searching, directed vertex separation and directed pathwidth Digraph searching, directed vertex separation and directed pathwidth](/preview/png/418963.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 156, Issue 10, 28 May 2008, Pages 1822–1837
Journal: Discrete Applied Mathematics - Volume 156, Issue 10, 28 May 2008, Pages 1822–1837
نویسندگان
Boting Yang, Yi Cao,