{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:11Z","timestamp":1725664331309},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540591757"},{"type":"electronic","value":"9783540492207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59175-3_80","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:05:13Z","timestamp":1330257913000},"page":"49-59","source":"Crossref","is-referenced-by-count":0,"title":["Tight bounds for finding degrees from the adjacency matrix"],"prefix":"10.1007","author":[{"given":"R.","family":"Balasubramanian","sequence":"first","affiliation":[]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[]},{"given":"G.","family":"Srinivasaraghavan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"4_CR1","unstructured":"R. Balasubramanian, Venkatesh Raman and G. Srinivasaraghavan, The Complexity of Finding Certain Trees in Tournaments, Proceedings of the third Workshop on Algorithms and Data Structures, Lecture Notes in Computer Sciences, Springer Verlag 709 (1993) 142\u2013150."},{"volume-title":"Selected Topics in Graph Theory","year":"1978","key":"4_CR2","unstructured":"L. W. Beinke and R. S. Wilson, (Eds), Selected Topics in Graph Theory, Academic Press, New York\/London 1978."},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1137\/0403002","volume":"3","author":"A. Bar-Noy","year":"1990","unstructured":"A. Bar-Noy and J. Naor, Sorting, Minimal Feedback Sets, and Hamiltonian Paths in Tournaments, SIAM Jl. Discrete Math. 3(1), (1990) 7\u201320.","journal-title":"SIAM Jl. Discrete Math."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0196-6774(83)90011-1","volume":"4","author":"P. Hell","year":"1983","unstructured":"P. Hell and M. Rosenfeld, The Complexity of Finding Generalized Paths in Tournaments, Jl. Algorithms 4, 1983, pp 303\u2013309.","journal-title":"Jl. Algorithms"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(82)90064-3","volume":"14","author":"K.N. King","year":"1982","unstructured":"K.N. King and B. Smith-Thomas, An optimal algorithm for sink finding, Information Processing Letters 14 (1982) 109\u2013111.","journal-title":"Information Processing Letters"},{"key":"4_CR6","volume-title":"Topics on Tournaments","author":"J. W. Moon","year":"1968","unstructured":"J. W. Moon, Topics on Tournaments, Holt, Rinehart and Winston, New York, 1968."},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","volume":"3","author":"R. L. Rivest","year":"1976","unstructured":"R. L. Rivest and J. Vuillemin, On recognizing graph properties from adjacency matrices, Theoretical Computer Science 3 (1976) 371\u2013384.","journal-title":"Theoretical Computer Science"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"J. van Leeuwen, Graph Algorithms, Handbook of Theoretical Computer Science, (Ed) J. van Leeuwen, Elsevier Science 1990, pp 584.","DOI":"10.1016\/B978-0-444-88071-0.50015-1"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1137\/0217031","volume":"17","author":"A. C. Yao","year":"1988","unstructured":"A. C. Yao, Monotone Bipartite Graphs are Evasive, SIAM J. of Computing 17 (1988) 517\u2013520.","journal-title":"SIAM J. of Computing"}],"container-title":["Lecture Notes in Computer Science","LATIN '95: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59175-3_80.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:25:49Z","timestamp":1605630349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59175-3_80"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540591757","9783540492207"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-59175-3_80","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}