{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:38:11Z","timestamp":1725467891299},"publisher-location":"Berlin\/Heidelberg","reference-count":22,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040402","type":"book-chapter","created":{"date-parts":[[2006,8,2]],"date-time":"2006-08-02T20:03:50Z","timestamp":1154549030000},"page":"351-360","source":"Crossref","is-referenced-by-count":2,"title":["Analysis of a distributed scheduler for communication networks"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Malka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomo","family":"Moran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel","family":"Zaks","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1145\/4221.4227","volume":"32","author":"B. Awerbuch","year":"1985","unstructured":"B. Awerbuch, Complexity of network synchronization, Journal of the ACM 32, 1985, pp. 804\u2013823.","journal-title":"Journal of the ACM"},{"key":"35_CR2","volume-title":"Concurrency in systems with neighborhood constraints","author":"V.C. Barbosa","year":"1986","unstructured":"V.C. Barbosa, Concurrency in systems with neighborhood constraints, Ph.D. Dissertation, Computer Sci. Dept., Univ. of California, Los Angeles, 1986."},{"key":"35_CR3","volume-title":"Topics on Perfect Graphs, Annals of Discrete Math., 21","author":"C. Berge","year":"1984","unstructured":"C. Berge and V. Chv\u00e1tal, Topics on Perfect Graphs, Annals of Discrete Math., 21, North Holland, Amsterdam, 1984."},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0304-0208(08)72937-2","volume-title":"Topics on Perfect Graphs, Annals of Discrete Math., 21","author":"R.E. Bixby","year":"1984","unstructured":"R.E. Bixby, A composition for perfect graphs, in [BC] pp. 221\u2013224."},{"key":"35_CR5","unstructured":"V.C. Barbosa, E. Gafni, Concurrency in systems with neighborhood constraints, Proc. of Distributed Computing Systems, 1987, pp. 448\u2013455."},{"key":"35_CR6","volume-title":"Synchronizing asynchronous bounded delay networks, RC 12274","author":"C.T. Chou","year":"1986","unstructured":"C.T. Chou, I. Cidon, I. Gopal and S. Zaks, Synchronizing asynchronous bounded delay networks, RC 12274, IBM T. J. Watson Research Center, Yorktown Heights, N.Y., U.S.A., Oct. 1986."},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0012-365X(76)90036-4","volume":"14","author":"F.H. Clarke","year":"1976","unstructured":"F.H. Clarke and R.E. Jamison, Multicolourings, measures, and games on graphs, Discrete Math. 14 (1976), pp. 241\u2013245.","journal-title":"Discrete Math."},{"key":"35_CR8","unstructured":"I. Chlamtac, and S.Kutten, A spatial reuse TDMA\/FDMA for mobile multi-hop radio networks, INFOCOM Conf. Proc., Mar. 1985, pp. 385\u2013393."},{"key":"35_CR9","unstructured":"I. Cidon and M. Sidi, A distributed assignment algorithm for multi-hop packet-radio networks, IBM Communications\/Computer Science RC 12563 (#56508), 1987."},{"key":"35_CR10","unstructured":"S. Even, Graph Algorithms, Computer Science Press, 1979."},{"key":"35_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230140102","volume":"14","author":"S. Even","year":"1984","unstructured":"S. Even, O. Goldreich, S. Moran and P. Tong, On the NP-completeness of certain network testing problems, Networks 14 (1984), pp. 1\u201324.","journal-title":"Networks"},{"key":"35_CR12","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. Golumbic","year":"1980","unstructured":"M. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New york, 1980."},{"key":"35_CR13","volume-title":"Computers and Interactability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Interactability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979."},{"issue":"2","key":"35_CR14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Grotschel","year":"1981","unstructured":"M. Grotschel, L. Lov\u00e1sz and A. Schrijver, The ellipsoid method and its consequences in Combinatorial Theory, Combinatorica 1(2), 1981, pp. 169\u2013197.","journal-title":"Combinatorica"},{"key":"35_CR15","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/0095-8956(87)90031-1","volume":"43","author":"W.L. Hsu","year":"1987","unstructured":"W.L. Hsu, Decompositions of perfect graphs, J. Comb. Theory(B) 43, 1987, pp. 70\u201394.","journal-title":"J. Comb. Theory(B)"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"D.S. Johnson, The NP-Completeness column: an ongoing guide, J. of Algorithms, 1982, pp. 184.","DOI":"10.1016\/0196-6774(82)90026-8"},{"key":"35_CR17","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1137\/1.9781611970203","volume-title":"An Algorithmic Theory of Numbers, Graphs, and Convexity","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz, An Algorithmic Theory of Numbers, Graphs, and Convexity, Society for Industrial and Applied Math., Philadelphia PA, 1986, pp. 75\u201382."},{"key":"35_CR18","unstructured":"J. Malka, S. Moran and S. Zaks, Analysis of a distributed scheduler for communication networks, Technical Report 495, Computer Sci. Dept., Technion, ISRAEL, Feb. 1988."},{"key":"35_CR19","unstructured":"W. Narkiewitz and S. Kanematsu, Number Theory, World Scientific, 1983."},{"key":"35_CR20","series-title":"Technical Report","volume-title":"Simulation of parallel algorithms on a distributed network","author":"A. A. Schoone","year":"1986","unstructured":"A. A. Schoone and J. van Leeuwen, Simulation of parallel algorithms on a distributed network, Technical Report RUU-CS-86-1, Dept. of Computer Sci., Univ. of Utrecht, The Netherlands, Jan. 1986."},{"key":"35_CR21","unstructured":"A. S. Tanenbaum, Computer Networks, Prentice-Hall, 1981."},{"key":"35_CR22","series-title":"Technical Report","volume-title":"An improved upper bound for distributed election in bidirectional rings of processor","author":"J. Leeuwen van","year":"1985","unstructured":"J. van Leeuwen and R. B. Tan, An improved upper bound for distributed election in bidirectional rings of processor, Technical Report RUU-CS-85-23, Dept. of Computer Sci., Univ. of Utrecht, The Netherlands, Aug. 1985."}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040402.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T16:40:21Z","timestamp":1607532021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0040402","relation":{},"subject":[]}}