{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:32:12Z","timestamp":1726407132987},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424949"},{"type":"electronic","value":"9783540446798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44679-6_36","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T12:00:37Z","timestamp":1265716837000},"page":"328-337","source":"Crossref","is-referenced-by-count":0,"title":["On Assigning Prefix Free Codes to the Vertices of a Graph"],"prefix":"10.1007","author":[{"given":"N. S.","family":"Narayanaswamy","sequence":"first","affiliation":[]},{"given":"C. E.","family":"Veni Madhavan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,31]]},"reference":[{"unstructured":"Devdutt Dubashi, and K.V. Subrahmanyam, Notes on Prefix-free codes, Entropy and Sorting. Personal Communication","key":"36_CR1"},{"doi-asserted-by":"crossref","unstructured":"Jeff Kahn, and Jeong Han Kim, Entropy and Sorting. 24th Annual ACM STOC, pp178\u2013187, 1992","key":"36_CR2","DOI":"10.1145\/129712.129731"},{"unstructured":"Martin Grostshcel, Laszlo Lovasz, Alexander Schrijver, Geometric Algorithms and Combinatorial Optimization. Springer Verlag","key":"36_CR3"},{"doi-asserted-by":"crossref","unstructured":"J.A. Bondy, and U.S.R. Murthy Graph Theory with Applications. Elsevier North Holland 1976","key":"36_CR4","DOI":"10.1007\/978-1-349-03521-2"},{"doi-asserted-by":"crossref","unstructured":"Martin C. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, 1980","key":"36_CR5","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"36_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"19 79","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. (Freeman, San Fransisco, CA, 19 79)"},{"issue":"4","key":"36_CR7","first-page":"337","volume":"3","author":"G.S. Brodal","year":"1996","unstructured":"G.S. Brodal, Shiva Chaudhuri, J. Radhakrishnan, The Randomized Complexity of Maintaining the Minimum. Nordic Journal of Computing, Selected Papers of the 5th Scandinavian Workshop on Algorithm Theory (SWAT\u201996), 3(4):337\u2013351, 1996.","journal-title":"Nordic Journal of Computing, Selected Papers of the 5th Scandinavian Workshop on Algorithm Theory (SWAT\u201996)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44679-6_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T17:33:05Z","timestamp":1558805585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424949","9783540446798"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}