{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:07:32Z","timestamp":1730196452202,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/allerton.2015.7446984","type":"proceedings-article","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T16:58:11Z","timestamp":1461171491000},"page":"43-50","source":"Crossref","is-referenced-by-count":0,"title":["Polling one's friends: A graph theoretic view"],"prefix":"10.1109","author":[{"given":"Chenguang","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Hossein Karkeh","family":"Abadi","sequence":"additional","affiliation":[]},{"given":"Balaji","family":"Prabhakar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004612"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/09-AAP627"},{"key":"ref12","article-title":"Random graphs","author":"bollobas","year":"0","journal-title":"Cambridge University Press 2001"},{"key":"ref13","article-title":"Computers and intractability: A guide to the theory of np-completeness","author":"gary","year":"0","journal-title":"WH Freeman and Co 1979"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2005.10129105"},{"key":"ref15","first-page":"37r","article-title":"On the domination number of a random graph","volume":"8","author":"wieland","year":"2001","journal-title":"combinatoric"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90021-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548305007431"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.05.029"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/S0004972709000410"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879192"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339572"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.1884644"},{"key":"ref5","article-title":"Practical characterization of large networks using neighborhood information","author":"wang","year":"2013","journal-title":"arXiv abs\/1311 3037"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623720"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487684"},{"article-title":"10 tips to improve your online surveys","year":"2012","author":"johnson","key":"ref2"},{"year":"2010","key":"ref1","article-title":"Does adding one more question impact survey completion rate?"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772751"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"article-title":"SNAP Datasets: Stanford large network dataset collection","year":"2014","author":"leskovec","key":"ref21"}],"event":{"name":"2015 53rd Annual Allerton Conference on Communication, Control and Computing (Allerton)","start":{"date-parts":[[2015,9,29]]},"location":"Monticello, IL","end":{"date-parts":[[2015,10,2]]}},"container-title":["2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7444067\/7446973\/07446984.pdf?arnumber=7446984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T12:46:08Z","timestamp":1489754768000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7446984\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/allerton.2015.7446984","relation":{},"subject":[],"published":{"date-parts":[[2015,9]]}}}