{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T13:59:12Z","timestamp":1725803952184},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662448441"},{"type":"electronic","value":"9783662448458"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44845-8_11","type":"book-chapter","created":{"date-parts":[[2014,9,1]],"date-time":"2014-09-01T08:51:33Z","timestamp":1409561493000},"page":"163-178","source":"Crossref","is-referenced-by-count":10,"title":["Faster Way to Agony"],"prefix":"10.1007","author":[{"given":"Nikolaj","family":"Tatti","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/3-540-61680-2_67","volume-title":"Algorithms - ESA \u201996","author":"B.V. Cherkassky","year":"1996","unstructured":"Cherkassky, B.V., Goldberg, A.V.: Negative-cycle detection algorithms. In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 349\u2013363. Springer, Heidelberg (1996)"},{"issue":"7191","key":"11_CR2","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1038\/nature06830","volume":"453","author":"A. Clauset","year":"2008","unstructured":"Clauset, A., Moore, C., Newman, M.E.J.: Hierarchical structure and the prediction of missing links in networks. Nature\u00a0453(7191), 98\u2013101 (2008)","journal-title":"Nature"},{"key":"11_CR3","unstructured":"Cormen, T.H., Stein, C., Rivest, R.L., Leiserson, C.E.: Introduction to Algorithms. McGraw-Hill Higher Education (2001)"},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I. Dinur","year":"2005","unstructured":"Dinur, I., Safra, S.: On the hardness of approximating vertex cover. Annals of Mathematics\u00a0162(1), 439\u2013485 (2005)","journal-title":"Annals of Mathematics"},{"key":"11_CR5","unstructured":"Elo, A.E.: The rating of chessplayers, past and present. Arco Pub. (1978)"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/PL00009191","volume":"20","author":"G. Even","year":"1998","unstructured":"Even, G., Naor, J.S., Schieber, B., Sudan, M.: Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica\u00a020(2), 151\u2013174 (1998)","journal-title":"Algorithmica"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Gupte, M., Shankar, P., Li, J., Muthukrishnan, S., Iftode, L.: Finding hierarchy in directed online social networks. In: Proceedings of the 20th International Conference on World Wide Web, pp. 557\u2013566 (2011)","DOI":"10.1145\/1963405.1963484"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Henderson, K., Gallagher, B., Eliassi-Rad, T., Tong, H., Basu, S., Akoglu, L., Koutra, D., Faloutsos, C., Li, L.: Rolx: Structural role extraction & mining in large graphs. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1231\u20131239 (2012)","DOI":"10.1145\/2339530.2339723"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1006\/anbe.1998.1077","volume":"57","author":"K.A. Jameson","year":"1999","unstructured":"Jameson, K.A., Appleby, M.C., Freeman, L.C.: Finding an appropriate order for a hierarchy based on probabilistic dominance. Animal Behaviour\u00a057, 991\u2013998 (1999)","journal-title":"Animal Behaviour"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Macchia, L., Bonchi, F., Gullo, F., Chiarandini, L.: Mining summaries of propagations. In: IEEE 13th International Conference on Data Mining, pp. 498\u2013507 (2013)","DOI":"10.1109\/ICDM.2013.163"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Maiya, A.S., Berger-Wolf, T.Y.: Inferring the maximum likelihood hierarchy in social networks. In: Proceedings IEEE CSE 2009, 12th IEEE International Conference on Computational Science and Engineering, pp. 245\u2013250 (2009)","DOI":"10.1109\/CSE.2009.235"},{"issue":"1","key":"11_CR12","first-page":"249","volume":"30","author":"A. McCallum","year":"2007","unstructured":"McCallum, A., Wang, X., Corrada-Emmanuel, A.: Topic and role discovery in social networks with experiments on enron and academic email. J. Artif. Int. Res.\u00a030(1), 249\u2013272 (2007)","journal-title":"J. Artif. Int. Res."},{"key":"11_CR13","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Inc. (1982)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44845-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T20:18:39Z","timestamp":1568492319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44845-8_11"}},"subtitle":["Discovering Hierarchies in Directed Graphs"],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662448441","9783662448458"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44845-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}