{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:11Z","timestamp":1750306331849,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T00:00:00Z","timestamp":1467676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,5]]},"DOI":"10.1145\/2942358.2942388","type":"proceedings-article","created":{"date-parts":[[2016,7,5]],"date-time":"2016-07-05T12:23:45Z","timestamp":1467721425000},"page":"41-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Throughput characterization of node-based scheduling in multihop wireless networks"],"prefix":"10.1145","author":[{"given":"Bo","family":"Ji","sequence":"first","affiliation":[{"name":"Temple University, Philadelphia, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Sang","sequence":"additional","affiliation":[{"name":"Temple University, Philadelphia, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-21919-1","volume-title":"Factors and factorizations of graphs: Proof techniques in factor theory","author":"Akiyama J.","year":"2011","unstructured":"J. Akiyama and M. Kano . Factors and factorizations of graphs: Proof techniques in factor theory , volume 2031 of Lecture Notes in Mathematics . Springer , 2011 . J. Akiyama and M. Kano. Factors and factorizations of graphs: Proof techniques in factor theory, volume 2031 of Lecture Notes in Mathematics. Springer, 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0269964804182041"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS137"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177004828"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832229"},{"key":"e_1_3_2_1_6_1","volume-title":"trees, and flowers. Canadian Journal of mathematics, 17(3):449--467","author":"Edmonds J.","year":"1965","unstructured":"J. Edmonds . Paths , trees, and flowers. Canadian Journal of mathematics, 17(3):449--467 , 1965 . J. Edmonds. Paths, trees, and flowers. Canadian Journal of mathematics, 17(3):449--467, 1965."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1561\/1300000001"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555361"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.21215"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524617"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2015.7086428"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2035046"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2031719"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2010857"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2010888"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TENT.2006.872546"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879351"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.665102"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2177101"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555365"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1161089.1161116"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1007\/3-540-13345-3_42","volume-title":"Automata, Languages and Programming","author":"Spencer T. H.","year":"1984","unstructured":"T. H. Spencer and E. W. Mayr . Node weighted matching . In Automata, Languages and Programming , pages 454 -- 464 . Springer , 1984 . T. H. Spencer and E. W. Mayr. Node weighted matching. In Automata, Languages and Programming, pages 454--464. Springer, 1984."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.925091"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.182479"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2007.1061"},{"key":"e_1_3_2_1_27_1","volume-title":"Graph factors and matching extensions","author":"Yu Q. R.","year":"2010","unstructured":"Q. R. Yu and G. Liu . Graph factors and matching extensions . Springer , 2010 . Q. R. Yu and G. Liu. Graph factors and matching extensions. Springer, 2010."}],"event":{"name":"MobiHoc'16: The Seventeenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","ACM Association for Computing Machinery"],"location":"Paderborn Germany","acronym":"MobiHoc'16"},"container-title":["Proceedings of the 17th ACM International Symposium on Mobile Ad Hoc Networking and Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2942358.2942388","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2942358.2942388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:44Z","timestamp":1750222484000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2942358.2942388"}},"subtitle":["a novel application of the Gallai-Edmonds structure theorem"],"short-title":[],"issued":{"date-parts":[[2016,7,5]]},"references-count":26,"alternative-id":["10.1145\/2942358.2942388","10.1145\/2942358"],"URL":"https:\/\/doi.org\/10.1145\/2942358.2942388","relation":{},"subject":[],"published":{"date-parts":[[2016,7,5]]},"assertion":[{"value":"2016-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}