{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:07:29Z","timestamp":1759133249907},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,25]],"date-time":"2014-04-25T00:00:00Z","timestamp":1398384000000},"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":["J Math Model Algor"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s10852-014-9251-2","type":"journal-article","created":{"date-parts":[[2014,4,24]],"date-time":"2014-04-24T11:48:38Z","timestamp":1398340118000},"page":"13-33","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["ILIGRA: An Efficient Inverse Line Graph Algorithm"],"prefix":"10.1007","volume":"14","author":[{"given":"Dajie","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stojan","family":"Trajanovski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piet","family":"Van Mieghem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,25]]},"reference":[{"issue":"7307","key":"9251_CR1","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1038\/nature09182","volume":"466","author":"YY Ahn","year":"2010","unstructured":"Ahn, Y.Y., Bagrow, J.P., Lehmann, S.: Link communities reveal multiscale complexity in networks. Nature 466(7307), 761\u2013764 (2010)","journal-title":"Nature"},{"issue":"5439","key":"9251_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"key":"9251_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press, Cambridge (2001)"},{"key":"9251_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511693328","volume-title":"Cours d\u2019analyse de l\u2019Ecole Royale Polytechnique, vol. 3 (1821)","author":"AL Cauchy","year":"2009","unstructured":"Cauchy, A.L.: Cours d\u2019analyse de l\u2019Ecole Royale Polytechnique, vol. 3 (1821). Imprimerie royale, Paris (reissued by Cambridge University Press), Cambridge (2009)"},{"key":"9251_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511751752","volume-title":"Spectral Generalizations of Line Graphs","author":"D Cvetkovi\u0107","year":"2004","unstructured":"Cvetkovi\u0107, D., Rowlinson, P., Simi\u0107, S.: Spectral Generalizations of Line Graphs. Cambridge University Press, Cambridge (2004)"},{"key":"9251_CR6","doi-asserted-by":"crossref","unstructured":"Degiorgi, D.G., Simon, K.: A dynamic algorithm for line graph recognition. In: Proceedings of 21st International Workshop on Graph-Theoretic Concepts in Computer Science (Lecture Notes in Computer Science 1017), pp. 37\u201348. Springer-Verlag (1995)","DOI":"10.1007\/3-540-60618-1_64"},{"key":"9251_CR7","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erdo\u030bs","year":"1959","unstructured":"Erdo\u030bs, P., R\u00e9nyi, A.: On random graphs, I. Publ. Math. (Debr.) 6, 290\u2013297 (1959)","journal-title":"Publ. Math. (Debr.)"},{"key":"9251_CR8","doi-asserted-by":"crossref","unstructured":"Evans, T., Lambiotte, R.: Line graphs, link partitions, and overlapping communities. Phys. Rev. E 80(1), 016105 (2009)","DOI":"10.1103\/PhysRevE.80.016105"},{"key":"9251_CR9","volume-title":"Inequalities, 2nd edn","author":"GH Hardy","year":"1988","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities, 2nd edn. Cambridge University Press, Cambridge (1988)"},{"key":"9251_CR10","first-page":"75","volume":"50","author":"J Krausz","year":"1943","unstructured":"Krausz, J.: D\u00e9monstration nouvelle d\u2019un th\u00e9or\u00e8me de Whitney sur les r\u00e9seaux. Mat. Fiz. Lapok 50, 75\u201385 (1943)","journal-title":"Mat. Fiz. Lapok"},{"key":"9251_CR11","doi-asserted-by":"crossref","first-page":"2611","DOI":"10.1016\/j.physa.2011.03.009","volume":"390","author":"MJ Krawczyk","year":"2011","unstructured":"Krawczyk, M.J., Muchnik, L., Manka-Krason, A., Kulakowski, K.: Line graphs as social networks. Phys. A 390, 2611\u20132618 (2011)","journal-title":"Phys. A"},{"key":"9251_CR12","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/321850.321853","volume":"21","author":"PGH Lehot","year":"1974","unstructured":"Lehot, P.G.H.: An optimal algorithm to detect a line graph and output its root graph. J. ACM 21, 569\u2013575 (1974)","journal-title":"J. ACM"},{"issue":"2","key":"9251_CR13","first-page":"259","volume":"3","author":"A Manka-Krason","year":"2010","unstructured":"Manka-Krason, A., Kulakowski, K.: Assortativity in random line graphs. Acta Phys. Pol. B Proc. Suppl. 3(2), 259\u2013266 (2010)","journal-title":"Acta Phys. Pol. B Proc. Suppl."},{"issue":"1","key":"9251_CR14","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.cpc.2009.09.010","volume":"181","author":"A Manka-Krason","year":"2010","unstructured":"Manka-Krason, A., Mwijage, A., Kulakowski, K.: Clustering in random line graphs. Comput. Phys. Commun. 181(1), 118\u2013121 (2010)","journal-title":"Comput. Phys. Commun."},{"key":"9251_CR15","volume-title":"LEDA: A Platform for Combinatorial and Geometric Computing","author":"K Mehlhorn","year":"1999","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press, Cambridge (1999)"},{"issue":"207","key":"9251_CR16","first-page":"2611","volume":"24","author":"JC Nacher","year":"2004","unstructured":"Nacher, J.C., Ueda, U., Yamada, T., Kanehisa, M., Akutsu, T.: Line graphs as social networks. BMC Bioinfo. 24(207), 2611\u20132618 (2004)","journal-title":"BMC Bioinfo."},{"key":"9251_CR17","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.physa.2004.09.013","volume":"349","author":"JC Nacher","year":"2005","unstructured":"Nacher, J.C., Yamada, T., Goto, S., Kanehisa, M., Akutsu, T.: Two complementary representations of a scale-free network. Phys. A 349, 349\u2013363 (2005)","journal-title":"Phys. A"},{"key":"9251_CR18","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0196-6774(90)90034-C","volume":"11","author":"J Naor","year":"1990","unstructured":"Naor, J., Novick, M.B.: An efficient reconstruction of a graph from its line graph in parallel. J. Algoritm. 11, 132\u2013143 (1990)","journal-title":"J. Algoritm."},{"key":"9251_CR19","doi-asserted-by":"crossref","unstructured":"Ore, O.: Theory of Graphs, vol. 21. American Mathematical Society Colloquium Publications (1962)","DOI":"10.1090\/coll\/038"},{"key":"9251_CR20","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","volume":"2","author":"ND Roussopoulos","year":"1973","unstructured":"Roussopoulos, N.D.: A max{m, n} algorithm for detecting the graph h from its line graph g. Info. Process. Lett. 2, 108\u2013112 (1973)","journal-title":"Info. Process. Lett."},{"issue":"63","key":"9251_CR21","first-page":"21","volume":"49","author":"S Simi\u0107","year":"1990","unstructured":"Simi\u0107, S.: An algorithm to recognize a generalized line graphs and ouput its root graph. Publ. Math. Inst. (Belgrade) 49(63), 21\u201326 (1990)","journal-title":"Publ. Math. Inst. (Belgrade)"},{"key":"9251_CR22","volume-title":"Graph Spectra for Complex Networks","author":"P Mieghem Van","year":"2011","unstructured":"Van Mieghem, P.: Graph Spectra for Complex Networks. Cambridge University Press, Cambridge (2011)"},{"key":"9251_CR23","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01904834","volume":"16","author":"ACM Rooij van","year":"1965","unstructured":"van Rooij, A.C.M., Wilf, H.S.: The interchange graph of a finite graph. Acta Math. Acad. Sci. Hung. 16, 263\u2013269 (1965)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"9251_CR24","doi-asserted-by":"crossref","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H Whitney","year":"1932","unstructured":"Whitney, H.: Congruent graphs and the connectivity of graphs. Am. J. Math. 54, 150\u2013168 (1932)","journal-title":"Am. J. Math."}],"container-title":["Journal of Mathematical Modelling and Algorithms in Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-014-9251-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-014-9251-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-014-9251-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T11:02:15Z","timestamp":1689159735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-014-9251-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,25]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9251"],"URL":"https:\/\/doi.org\/10.1007\/s10852-014-9251-2","relation":{},"ISSN":["2214-2487","2214-2495"],"issn-type":[{"value":"2214-2487","type":"print"},{"value":"2214-2495","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,25]]}}}