摘要 : In traditional edge searching one tries to clean all of the edges in a graph employing the least number of searchers. It is assumed that each edge of the graph initially has a weight equal to one. In this paper we modify the probl... 展开
作者 | Yasar~ O Dyer~ D Pike~ DA Kondratieva~ M |
---|---|
作者单位 | |
期刊名称 | 《Discrete Applied Mathematics》 |
总页数 | 11 |
语种/中图分类号 | 英语 / O158 |
关键词 | Edge searching Monotonicity Pathwidth |
馆藏号 | N2008EPST0000706 |