{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:09Z","timestamp":1725662889606},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540133452"},{"type":"electronic","value":"9783540388869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1984]]},"DOI":"10.1007\/3-540-13345-3_11","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:01:53Z","timestamp":1330192913000},"page":"128-136","source":"Crossref","is-referenced-by-count":4,"title":["Concurrent transmissions in broadcast networks"],"prefix":"10.1007","author":[{"given":"Charles J.","family":"Colbourn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Proskurowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"N. Abramson, \"The ALOHA System \u2014 Another Alternative for Computer Communications\", Proc. AFIPS FJCC 37 (1970).","DOI":"10.21236\/AD0707853"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"R. J. Duffin","year":"1965","unstructured":"R.J. Duffin, \"Topology of series-parallel networks\", J. Math. Anal. Appl. 10 (1965) 303\u2013318.","journal-title":"J. Math. Anal. Appl."},{"key":"11_CR3","unstructured":"S. Even, O. Goldreich and P. Tong, \"On the NP-completeness of certain network testing problems\", TR 230, Computer Science Department, Technion, Haifa, Israel."},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1002\/net.3230110304","volume":"11","author":"A. M. Farley","year":"1981","unstructured":"A.M. Farley, \"Networks immune to isolated failures\", Networks 11 (1981) 255\u2013268.","journal-title":"Networks"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230120404","volume":"12","author":"A. M. Farley","year":"1982","unstructured":"A.M. Farley and A. Proskurowski, \"Networks immune to isolated line failures\", Networks 12 (1982) 393\u2013403.","journal-title":"Networks"},{"key":"11_CR6","unstructured":"A.M. Farley and A. Proskurowski, \"On computing the open irredundance number of a tree\", Proceedings of the Second West Coast Conference on Computing in Graph Theory, Eugene OR, 1983, proceedings to appear, also Technical Report UO-CIS-TR-83-\/4, Dept. of Computer and Information Science, University of Oregon, 1983."},{"key":"11_CR7","first-page":"47","volume":"38","author":"A. M. Farley","year":"1983","unstructured":"A.M. Farley and N. Shacham, \"Senders in Broadcast Networks: Open Irredundancy in Graphs\", Congressus Numerantium 38 (1983) 47\u201357.","journal-title":"Congressus Numerantium"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"E.M. Neufeld and C.J. Colbourn, \"The most reliable series-parallel networks\", Networks, to appear.","DOI":"10.1002\/net.3230150104"},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0012-365X(74)90042-9","volume":"7","author":"D. J. Rose","year":"1974","unstructured":"D.J. Rose, \"On simple characterizations of k-trees\", Discrete Math. 7 (1974) 317\u2013322.","journal-title":"Discrete Math."},{"key":"11_CR10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/net.3230130202","volume":"13","author":"J. A. Wald","year":"1983","unstructured":"J.A. Wald and C.J. Colbourn, \"Steiner trees, partial 2-trees, and minimum IFI networks\", Networks 13 (1983) 159\u2013167.","journal-title":"Networks"},{"key":"11_CR11","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1016\/0026-2714(83)91008-9","volume":"23","author":"J. A. Wald","year":"1983","unstructured":"J.A. Wald and C.J. Colbourn, \"Steiner trees in probabilistic networks\", Microelectronics and Reliability 23 (1983) 837\u2013840.","journal-title":"Microelectronics and Reliability"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-13345-3_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:44Z","timestamp":1619556764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-13345-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984]]},"ISBN":["9783540133452","9783540388869"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-13345-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1984]]}}}