{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:09:16Z","timestamp":1725890956133},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642169878"},{"type":"electronic","value":"9783642169885"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16988-5_3","type":"book-chapter","created":{"date-parts":[[2010,10,23]],"date-time":"2010-10-23T03:14:03Z","timestamp":1287803643000},"page":"31-33","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Hierarchical Neighbor Graphs: A Sparse Connected Structure for Euclidean Point Sets"],"prefix":"10.1007","author":[{"given":"Amitabha","family":"Bagchi","sequence":"first","affiliation":[]},{"given":"Adit","family":"Madan","sequence":"additional","affiliation":[]},{"given":"Achal","family":"Premi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"3_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00453-004-1138-6","volume":"42","author":"A. Bagchi","year":"2005","unstructured":"Bagchi, A., Buchsbaum, A., Goodrich, M.T.: Biased skip lists. Algorithmica\u00a042(1), 31\u201348 (2005)","journal-title":"Algorithmica"},{"key":"3_CR2","unstructured":"Bagchi, A., Madan, A., Premi, A.: Hierarchical neighbor graphs: An energy-efficient bounded degree connected structure for wireless sensor networks (July 2009), arXiv:0903.0742v3 [cs.NI]"},{"key":"3_CR3","unstructured":"Bagchi, A., Madan, A., Premi, A.: Hierarchical neighbor graphs: A fully distributed topology for data collection in wireless sensor networks (2010), \n                  \n                    http:\/\/www.cse.iitd.ernet.in\/~bagchi"},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S000186780000001X","volume":"37","author":"P. Ballister","year":"2005","unstructured":"Ballister, P., Bollob\u00e1s, B., Sarkar, A., Walters, M.: Connectivity of random k-nearest-neighbour graphs. Adv. Appl. Prob (SGSA)\u00a037, 1\u201324 (2005)","journal-title":"Adv. Appl. Prob. (SGSA)"},{"issue":"6","key":"3_CR5","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/78973.78977","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Commun. ACM\u00a033(6), 668\u2013676 (1990)","journal-title":"Commun. ACM"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/B:WINE.0000013081.09837.c0","volume":"10","author":"F. Xue","year":"2004","unstructured":"Xue, F., Kumar, P.R.: The number of neighbors needed for the connectivity of wireless networks. Wirel. Netw.\u00a010, 169\u2013181 (2004)","journal-title":"Wirel. Netw."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16988-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T15:50:27Z","timestamp":1553183427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16988-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642169878","9783642169885"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16988-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}