{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:52:20Z","timestamp":1742982740951,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540587156"},{"type":"electronic","value":"9783540490548"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58715-2_119","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:41:07Z","timestamp":1330256467000},"page":"125-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An O(n) algorithm for realizing degree sequences"],"prefix":"10.1007","author":[{"given":"Srinivasa Rao","family":"Arikati","sequence":"first","affiliation":[]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"11_CR1","unstructured":"S.R. Arikati and A. Maheshwari. Realizing degree sequences in parallel. To appear in 5th ISAAC'94, China."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0024-3795(94)90349-2","volume":"199","author":"S.R. Arikati","year":"1994","unstructured":"S.R. Arikati and U.N. Peled. Degree sequences and majorization. Linear Algebra Appl, 199: 179\u2013211, 1994.","journal-title":"Linear Algebra Appl"},{"key":"11_CR3","first-page":"38","volume":"762","author":"T. Asano","year":"1993","unstructured":"T. Asano. Graphical degree sequence problems with connectivity requirements. 4th ISAAC'93, LNCS 762: 38\u201347, 1993.","journal-title":"4th ISAAC'93"},{"key":"11_CR4","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"C. Berge. Graphs and Hypergraphs. North-Holland, Amsterdam, 1973."},{"volume-title":"Large-Scale Networks: Theory and Design","year":"1976","key":"11_CR5","unstructured":"F.T. Boesch (Editor). Large-Scale Networks: Theory and Design. IEEE Press, New York, 1976."},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0167-5060(08)70731-3","volume":"1","author":"V. Chv\u00e1tal","year":"1977","unstructured":"V. Chv\u00e1tal and P.L. Hammer. Aggregation of inequalities in integer programming. Ann. Discrete Math., 1: 145\u2013162, 1977.","journal-title":"Ann. Discrete Math."},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"A. Dessmark, A. Lingas and O. Garrido. On the parallel complexity of maximum f-matching and the degree sequence problem. To appear in MFCS'94. LNCS, Springer-Verlag, 1994.","DOI":"10.1007\/3-540-58338-6_78"},{"key":"11_CR8","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980."},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1137\/0602006","volume":"2","author":"P.L. Hammer","year":"1981","unstructured":"P.L. Hammer, T. Ibaraki, and B. Simeone. Threshold sequences. SIAM J. Algebraic Discrete Methods, 2: 39\u201349, 1981.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"11_CR10","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"F. Harary. Graph Theory. Addison-Wesley, New York, 1969."},{"key":"11_CR11","volume-title":"An Introduction to Parallel Algorithms","author":"J. J\u00e1J\u00e1","year":"1992","unstructured":"J. J\u00e1J\u00e1, An Introduction to Parallel Algorithms. Addison-Wesley, New York, 1992."},{"key":"11_CR12","first-page":"869","volume-title":"Handbook of Theoretical Computer Science","author":"R.M. Karp","year":"1990","unstructured":"R.M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, pages 869\u2013942. Elsevier, Amsterdam, 1990."},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0095-8956(73)90037-3","volume":"B 15","author":"M. Koren","year":"1973","unstructured":"M. Koren. Extreme degree sequences of simple graphs. J. Combin. Theory Ser., B 15: 213\u2013224, 1973.","journal-title":"J. Combin. Theory Ser."},{"key":"11_CR14","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz and M. Plummer. Matching Theory. Academic Press, Budapest, Hungary, 1986."},{"key":"11_CR15","volume-title":"Inequalities: Theory of Majorization and its Applications","author":"A.W. Marshall","year":"1979","unstructured":"A.W. Marshall and I. Olkin. Inequalities: Theory of Majorization and its Applications, Academic Press, New York, 1979."},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1007\/BF01070234","volume":"23","author":"R.I. Tyshkevich","year":"1987","unstructured":"R.I. Tyshkevich, A.A. Chernyak and Zh. A. Chernyak. Graphs and Degree Sequences I. Cybernetics, 23: 734\u2013745, 1987.","journal-title":"Cybernetics"},{"key":"11_CR17","first-page":"525","volume-title":"Handbook of Theoretical Computer Science","author":"J. Leeuwen van","year":"1990","unstructured":"J. van Leeuwen. Graph algorithms. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A, pages 525\u2013631. Elsevier, Amsterdam, 1990."}],"container-title":["Lecture Notes in Computer Science","Foundation of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58715-2_119","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:50:39Z","timestamp":1578509439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58715-2_119"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540587156","9783540490548"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-58715-2_119","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}