{"id":"https://openalex.org/W1977740933","doi":"https://doi.org/10.1109/icacci.2013.6637339","title":"Heuristic for maximum matching in directed complex networks","display_name":"Heuristic for maximum matching in directed complex networks","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W1977740933","doi":"https://doi.org/10.1109/icacci.2013.6637339","mag":"1977740933"},"language":"en","primary_location":{"id":"doi:10.1109/icacci.2013.6637339","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2013.6637339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063683767","display_name":"Ayan Chatterjee","orcid":"https://orcid.org/0000-0003-0407-7702"},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Ayan Chatterjee","raw_affiliation_strings":["Department of ETCE, Jadavpur University, Kolkata, India","[Department of ETCE, Jadavpur University, Kolkata, India]"],"affiliations":[{"raw_affiliation_string":"Department of ETCE, Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"[Department of ETCE, Jadavpur University, Kolkata, India]","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016409294","display_name":"Debayan Das","orcid":"https://orcid.org/0000-0003-1843-0124"},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Debayan Das","raw_affiliation_strings":["Department of ETCE, Jadavpur University, Kolkata, India","[Department of ETCE, Jadavpur University, Kolkata, India]"],"affiliations":[{"raw_affiliation_string":"Department of ETCE, Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"[Department of ETCE, Jadavpur University, Kolkata, India]","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024123782","display_name":"Mrinal Kanti Naskar","orcid":"https://orcid.org/0000-0001-9357-887X"},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Mrinal K. Naskar","raw_affiliation_strings":["Department of ETCE, Jadavpur University, Kolkata, India","[Department of ETCE, Jadavpur University, Kolkata, India]"],"affiliations":[{"raw_affiliation_string":"Department of ETCE, Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"[Department of ETCE, Jadavpur University, Kolkata, India]","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091547985","display_name":"Nabamita Pal","orcid":"https://orcid.org/0000-0003-3186-1308"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nabamita Pal","raw_affiliation_strings":["Department of EE, Techno India, Kolkata, India","Deptt. of EE, Techno India, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Department of EE, Techno India, Kolkata, India","institution_ids":[]},{"raw_affiliation_string":"Deptt. of EE, Techno India, Kolkata, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024230770","display_name":"Amitava Mukherjee","orcid":"https://orcid.org/0000-0003-1694-3911"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amitava Mukherjee","raw_affiliation_strings":["IBM India Private Limited, Kolkata, India","IBM India Private Ltd., Kolkata, India"],"affiliations":[{"raw_affiliation_string":"IBM India Private Limited, Kolkata, India","institution_ids":[]},{"raw_affiliation_string":"IBM India Private Ltd., Kolkata, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5063683767"],"corresponding_institution_ids":["https://openalex.org/I170979836"],"apc_list":null,"apc_paid":null,"fwci":2.4943,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.8914936,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1146","last_page":"1151"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12592","display_name":"Opinion Dynamics and Social Influence","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8611869812011719},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.728365421295166},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6951992511749268},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6181501150131226},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5732678174972534},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.5368434190750122},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4987645149230957},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4928719997406006},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4659581780433655},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4552752375602722},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.431123822927475},{"id":"https://openalex.org/keywords/complex-network","display_name":"Complex network","score":0.42910975217819214},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41218283772468567},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3376794457435608},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3233550488948822},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17708134651184082},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1674768328666687}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8611869812011719},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.728365421295166},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6951992511749268},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6181501150131226},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5732678174972534},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.5368434190750122},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4987645149230957},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4928719997406006},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4659581780433655},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4552752375602722},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.431123822927475},{"id":"https://openalex.org/C34947359","wikidata":"https://www.wikidata.org/wiki/Q665189","display_name":"Complex network","level":2,"score":0.42910975217819214},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41218283772468567},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3376794457435608},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3233550488948822},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17708134651184082},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1674768328666687},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icacci.2013.6637339","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icacci.2013.6637339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4000000059604645,"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W207285256","https://openalex.org/W1516535719","https://openalex.org/W1536381121","https://openalex.org/W1972577981","https://openalex.org/W1976969221","https://openalex.org/W1994368767","https://openalex.org/W1995213405","https://openalex.org/W2008620264","https://openalex.org/W2017202214","https://openalex.org/W2033718639","https://openalex.org/W2065769502","https://openalex.org/W2069994955","https://openalex.org/W2070722739","https://openalex.org/W2080090262","https://openalex.org/W2101420429","https://openalex.org/W2157529519","https://openalex.org/W2164727176","https://openalex.org/W2175110005","https://openalex.org/W2296217093","https://openalex.org/W2346826974","https://openalex.org/W2997134027","https://openalex.org/W3037340819","https://openalex.org/W3103071483","https://openalex.org/W3143219376","https://openalex.org/W4240438002","https://openalex.org/W6632026002","https://openalex.org/W6653380391","https://openalex.org/W6670495582","https://openalex.org/W6683518376"],"related_works":["https://openalex.org/W2054458431","https://openalex.org/W2077309407","https://openalex.org/W3181584291","https://openalex.org/W2371352078","https://openalex.org/W4205756423","https://openalex.org/W2567825307","https://openalex.org/W2966673134","https://openalex.org/W2352066879","https://openalex.org/W1559931991","https://openalex.org/W2080136900"],"abstract_inverted_index":{"Determining":[0],"maximum":[1,72,107],"matching":[2,73,108],"in":[3,20,74,109],"any":[4],"network":[5],"has":[6],"always":[7],"been":[8],"a":[9,17,65],"problem":[10,85],"of":[11,45,58,86,111],"immense":[12],"concern.":[13],"Its":[14],"solution":[15],"is":[16],"necessary":[18],"requirement":[19],"structural":[21],"control":[22],"theory":[23],"for":[24],"controlling":[25],"real":[26,113],"world":[27,114],"complex":[28,115],"networks.":[29,150],"The":[30],"prevalent":[31],"classical":[32,84],"approach":[33],"through":[34],"the":[35,43,46,55,87,94,112,147],"Hopcroft-Karp":[36],"algorithm":[37,69,100],"and":[38,130],"other":[39],"proposed":[40],"algorithms":[41],"require":[42],"determination":[44],"bipartite":[47,80],"equivalent":[48],"graph":[49],"(i.e.,":[50],"network),":[51],"which":[52,117],"belongs":[53],"to":[54,70,105,146],"NP-complete":[56],"class":[57,89],"problems.":[59],"In":[60],"this":[61,83],"article,":[62],"we":[63],"develop":[64],"degree-first":[66],"greedy":[67],"search":[68],"determine":[71],"unipartite":[75],"graphs":[76],"without":[77],"determining":[78],"its":[79],"equivalent.":[81],"Thus":[82],"NP-Complete":[88],"can":[90,101,133],"be":[91,102,134],"solved":[92],"using":[93,124],"heuristic,":[95],"with":[96,136],"reduced":[97],"complexity.":[98],"This":[99],"efficiently":[103],"used":[104],"find":[106],"most":[110],"networks":[116,132],"follow":[118],"Erdos-R\u00e9nyi":[119],"model.":[120],"Simulation":[121],"results":[122],"obtained":[123],"our":[125],"heuristic":[126],"show":[127],"that":[128],"dense":[129],"homogenous":[131],"controlled":[135],"fewer":[137],"controller":[138],"nodes":[139],"popularly":[140],"termed":[141],"as":[142],"driver":[143],"nodes,":[144],"compared":[145],"sparse":[148],"inhomogeneous":[149]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}