{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T21:10:02Z","timestamp":1748466602652,"version":"3.41.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_46","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T15:12:41Z","timestamp":1435072361000},"page":"587-600","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximal and Maximum Transitive Relation Contained in a Given Binary Relation"],"prefix":"10.1007","author":[{"given":"Sourav","family":"Chakraborty","sequence":"first","affiliation":[]},{"given":"Shamik","family":"Ghosh","sequence":"additional","affiliation":[]},{"given":"Nitesh","family":"Jha","sequence":"additional","affiliation":[]},{"given":"Sasanka","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"issue":"2","key":"46_CR1","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0201008","volume":"1","author":"AV Aho","year":"1972","unstructured":"Aho, A.V., Garey, M.R., Ullman, J.D.: The transitive reduction of a directed graph. SIAM J. Comput. 1(2), 131\u2013137 (1972)","journal-title":"SIAM J. Comput."},{"key":"46_CR2","series-title":"The IMA Volumes in Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-1-4613-8369-7_7","volume-title":"Graph Theory and Sparse Matrix Computation","author":"FL Alvarado","year":"1993","unstructured":"Alvarado, F.L., Pothen, A., Schreiber, R.: Highly parallel sparse triangular solution. In: George, A., Gilbert, J.R., Liu, J.W.H. (eds.) Graph Theory and Sparse Matrix Computation. The IMA Volumes in Mathematics and its Applications, vol. 56, pp. 141\u2013157. Springer, New York (1993)"},{"key":"46_CR3","unstructured":"Chakraborty, S., Jha, N.: On the size of maximum directed cuts in triangle free graphs (2015) (unpublished)"},{"issue":"3","key":"46_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251\u2013280 (1990)","journal-title":"J. Symb. Comput."},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01940892","volume":"10","author":"PW Purdom Jr","year":"1970","unstructured":"Purdom Jr., P.W.: A transitive closure algorithm. BIT 10, 76\u201394 (1970)","journal-title":"BIT"},{"key":"46_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-47867-1_6","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Lewin","year":"2002","unstructured":"Lewin, M., Livnat, D., Zwick, U.: Improved rounding techniques for the MAX 2-sat and MAX DI-CUT problems. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol. 2337, pp. 67\u201382. Springer, Heidelberg (2002)"},{"issue":"3","key":"46_CR7","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/321526.321534","volume":"16","author":"DM Moyles","year":"1969","unstructured":"Moyles, D.M., Thompson, G.L.: An algorithm for finding a minimum equivalent graph of a digraph. J. ACM 16(3), 455\u2013460 (1969)","journal-title":"J. ACM"},{"key":"46_CR8","first-page":"1","volume":"74","author":"E Nuutila","year":"1995","unstructured":"Nuutila, E.: Efficient transitive closure computation in large digraphs. Acta Polytechnica Scandinavia: Math. Comput. Eng. 74, 1\u2013124 (1995)","journal-title":"Acta Polytechnica Scandinavia: Math. Comput. Eng."},{"issue":"1","key":"46_CR9","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S Warshall","year":"1962","unstructured":"Warshall, S.: A theorem on boolean matrices. J. ACM 9(1), 11\u201312 (1962)","journal-title":"J. ACM"},{"key":"46_CR10","unstructured":"Williams, V.V.: Multiplying matrices faster than coppersmith-winograd. In: Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19\u201322, 2012, pp. 887\u2013898 (2012)"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Yannakakis, M.: Node- and edge-deletion np-complete problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1\u20133, 1978, San Diego, California, USA, pp. 253\u2013264 (1978)","DOI":"10.1145\/800133.804355"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T20:33:55Z","timestamp":1748464435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}