{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T09:40:28Z","timestamp":1749980428582,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1109\/icacci.2013.6637339","type":"proceedings-article","created":{"date-parts":[[2013,10,29]],"date-time":"2013-10-29T19:21:09Z","timestamp":1383074469000},"page":"1146-1151","source":"Crossref","is-referenced-by-count":9,"title":["Heuristic for maximum matching in directed complex networks"],"prefix":"10.1109","author":[{"given":"Ayan","family":"Chatterjee","sequence":"first","affiliation":[]},{"given":"Debayan","family":"Das","sequence":"additional","affiliation":[]},{"given":"Mrinal K.","family":"Naskar","sequence":"additional","affiliation":[]},{"given":"Nabamita","family":"Pal","sequence":"additional","affiliation":[]},{"given":"Amitava","family":"Mukherjee","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"On the distributed complexity of computing maximal matchings","author":"hanckowiak","year":"1998","journal-title":"ACM-SIAM SODA"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"15","first-page":"127","article-title":"Bipartite graphs as models of complex networks","author":"guillaume","year":"2004","journal-title":"CAAN"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1038\/nature10011"},{"key":"13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TAC.1974.1100557","article-title":"Structural controllability","volume":"19","author":"lin","year":"1974","journal-title":"IEEE Trans Automat Contr"},{"key":"14","first-page":"2","article-title":"An n5\/2 algorithm for maximum matchings in bipartite graphs","author":"hopcroft","year":"1973","journal-title":"SIAM J Comput"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199211517.001.0001"},{"journal-title":"Nodal Dynamics Not Degree Distributions Determine the Structural Controllability of Complex Networks","year":"2012","author":"cowan","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"20","article-title":"Efficient algorithms for finding maximum matching in graphs","author":"galil","year":"1980","journal-title":"ACM Computing Surveys"},{"key":"2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/316194.316229","article-title":"On power-law relationships of the internet topology","volume":"29","author":"faloutsos","year":"1999","journal-title":"Comp Comm Rev"},{"journal-title":"Complex Networks Article for Contemporary Physics","year":"2004","author":"evans","key":"1"},{"key":"10","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"barabasi","year":"1999","journal-title":"Science"},{"journal-title":"Matching Theory","year":"2009","author":"lovasz","key":"7"},{"journal-title":"The Number of Matchings in Random Graphs","year":"2006","author":"zdeborova","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/0301010"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1038\/35065725"},{"key":"9","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1126\/science.1173299","article-title":"Scale-Free networks: A decade and beyond","volume":"325","author":"barabasi","year":"2009","journal-title":"Science"},{"key":"8","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"erds","year":"1960","journal-title":"Publ Math Inst Hung Acad Sci"}],"event":{"name":"2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","start":{"date-parts":[[2013,8,22]]},"location":"Mysore","end":{"date-parts":[[2013,8,25]]}},"container-title":["2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6621059\/6637135\/06637339.pdf?arnumber=6637339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T21:02:08Z","timestamp":1498078928000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6637339\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/icacci.2013.6637339","relation":{},"subject":[],"published":{"date-parts":[[2013,8]]}}}