Location of Repository

How to search a tree to which Eulerian networks are attached

By Steven Alpern

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=

Topics: QA Mathematics
Publisher: Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science
Year: 2005
OAI identifier: oai:eprints.lse.ac.uk:13930
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.cdam.lse.ac.uk (external link)
  • http://eprints.lse.ac.uk/13930... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.