{"id":"https://openalex.org/W2275898331","doi":null,"title":"A simple algorithm to find maximum matching for complete graph and complete bipartite graph: using incidence matrix approach","display_name":"A simple algorithm to find maximum matching for complete graph and complete bipartite graph: using incidence matrix approach","publication_year":2016,"publication_date":"2016-02-26","ids":{"openalex":"https://openalex.org/W2275898331","mag":"2275898331"},"language":"en","primary_location":{"id":"mag:2275898331","doi":null,"is_oa":false,"landing_page_url":"http://scik.org/index.php/jmcs/article/view/2472","pdf_url":null,"source":{"id":"https://openalex.org/S2764352028","display_name":"Journal of Mathematical and Computational Science","issn_l":"1927-5307","issn":["1927-5307"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["poland-20"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Mathematical and Computational Science","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2275898331"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5016175867","display_name":"Ishwar Baidari","orcid":"https://orcid.org/0000-0002-3628-3546","observed_orcids":["https://orcid.org/0000-0002-3628-3546"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ishwar Baidari","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-3628-3546","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051361986","display_name":"Vijay Kumar Gurani","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vijaykumar Gurani","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":"2","first_page":"272","last_page":"280"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.014000000432133675,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.002899999963119626,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-matching","display_name":"maximum matching","score":1.0},{"id":"https://openalex.org/keywords/complete-graphs","display_name":"complete graphs","score":0.8939999938011169},{"id":"https://openalex.org/keywords/complete-bipartite-graphs","display_name":"complete bipartite graphs","score":1.0},{"id":"https://openalex.org/keywords/incidence-matrix","display_name":"incidence matrix","score":0.9879999756813049},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.9539999961853027},{"id":"https://openalex.org/keywords/graph-matching","display_name":"graph matching","score":0.6259999871253967}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8274022340774536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8122357726097107},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.806433916091919},{"id":"https://openalex.org/C85136909","wikidata":"https://www.wikidata.org/wiki/Q939272","display_name":"Incidence matrix","level":3,"score":0.6107056140899658},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5863503217697144},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.5752716064453125},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.567084550857544},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5513368844985962},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.4682375490665436},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4655523896217346},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.44633162021636963},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43514540791511536},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4110386371612549},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.37394437193870544},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36838215589523315},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2511383891105652},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2275898331","doi":null,"is_oa":false,"landing_page_url":"http://scik.org/index.php/jmcs/article/view/2472","pdf_url":null,"source":{"id":"https://openalex.org/S2764352028","display_name":"Journal of Mathematical and Computational Science","issn_l":"1927-5307","issn":["1927-5307"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["poland-20"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Journal of Mathematical and Computational Science","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2157529519","https://openalex.org/W2184969544","https://openalex.org/W4205585695","https://openalex.org/W7098604283","https://openalex.org/W1518546215","https://openalex.org/W1998124720","https://openalex.org/W1663653755","https://openalex.org/W7100698265","https://openalex.org/W7095964654","https://openalex.org/W4234482038"],"abstract_inverted_index":{"A":[0],"simple":[1],"graph":[2,123,127],"G(V,E)":[4],"has":[6],"vertex":[7,76],"set":[8,14,29],"V":[10],"and":[12,74,124],"edge":[13,28,60,80],"E":[16,31,46],"then":[18],"matching":[19,95,120],"means":[20],"a":[21,113],"subset":[22],"S":[24,40,50,63,72,83,92,97],"of":[26,38,58,61,81,102],"the":[27,54],"such":[33],"that":[34],"no":[35],"two":[36,55],"edges":[37,103],"are":[42,65],"adjacent":[43],"in":[44],".":[47,93],"If":[48],"is":[52,85,104],"matching,":[53],"end":[56],"points":[57],"each":[59,75],"said":[66,86],"to":[67,87,117],"be":[68,88],"matched":[69],"under":[70],",":[73],"incident":[77],"with":[78,99],"an":[79],"covered":[89],"by":[90],"The":[94],"maximum":[100,106,119],"number":[101],"called":[105],"matching.":[107],"In":[108],"this":[109],"paper":[110],"we":[111],"present":[112],"polynomial":[114],"time":[115],"algorithm":[116],"find":[118],"for":[121],"complete":[122,125],"bipartite":[126],"using":[128],"incidence":[129],"matrix":[130],"approach.":[131]},"counts_by_year":[],"updated_date":"2026-09-25T08:18:29.962427","created_date":"2016-06-24T00:00:00"}