Alpern, Steven (2005) How to search a tree to which Eulerian networks are attached. CDAM research report, CDAM-LSE- 2005-14. Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, London, UK.
Full text not available from this repository.Abstract
We call a network partly Eulerian if consists of a tree (of length a and radius r) to which a nite number of disjoint Eulerian networks (of total length b) are attached, each at a single point. We show that for such networks, a search strategy consisting equiprobably of a minimal (Chinese Postman) covering path and its reverse path is optimal, in the sense that it minimizes (at a + b=2
| Item Type: | Monograph (Report) |
|---|---|
| Official URL: | http://www.cdam.lse.ac.uk |
| Additional Information: | © 2005 the author |
| Library of Congress subject classification: | Q Science > QA Mathematics |
| Sets: | Research centres and groups > Management Science Group Departments > Mathematics Departments > Management |
| Identification Number: | CDAM-LSE- 2005-14 |
| Date Deposited: | 23 Oct 2008 10:28 |
| URL: | http://eprints.lse.ac.uk/13930/ |
Actions (login required)
 |
Record administration - authorised staff only |
