{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T01:38:20Z","timestamp":1783820300697,"version":"3.55.0"},"reference-count":5,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7802,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1985,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:italic>Q<\/jats:italic> be a connected network with a distinguished (starting) point <jats:italic>q<\/jats:italic><jats:sub>0<\/jats:sub>, whose are lengths sum to one. We associate with <jats:italic>Q<\/jats:italic> a \u201csearch value\u201d V(<jats:italic>Q<\/jats:italic>) representing the expected time needed for a searcher, starting at <jats:italic>q<\/jats:italic><jats:sub>0<\/jats:sub> and moving at unit speed, to find a moving hider. We assume neither sees the other until they meet. We demonstrate that the \u201cfigure\u2010eight\u201d network, consisting of two equal loops joined at a central starting point, has a search value not exceeding 15\/16. This contradicts a conjecture of Gal that the search value of any network is at least 1. In the other direction, we show that V(<jats:italic>Q<\/jats:italic>) \u2266 6<jats:italic>kD<\/jats:italic> for a network with <jats:italic>k<\/jats:italic> edges and diameter <jats:italic>D<\/jats:italic>.<\/jats:p>","DOI":"10.1002\/net.3230150208","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T19:20:48Z","timestamp":1178911248000},"page":"229-238","source":"Crossref","is-referenced-by-count":29,"title":["The search value of a network"],"prefix":"10.1002","volume":"15","author":[{"given":"Steve","family":"Alpern","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miroslav","family":"Asic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"S.Alpern andM.Asic Two search games on graphs. Theoretical Economics Discussion Paper Series International Center for Economics and Related Disciplines London School of Economics No. 60 (1982). 1\u201040."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/1024054"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/0317049"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0317009"},{"key":"e_1_2_1_6_2","volume-title":"Search games","author":"Gal S.","year":"1980"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230150208","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230150208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,20]],"date-time":"2023-10-20T21:23:03Z","timestamp":1697836983000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230150208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["10.1002\/net.3230150208"],"URL":"https:\/\/doi.org\/10.1002\/net.3230150208","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,6]]}}}