{"id":"https://openalex.org/W3213141013","doi":null,"title":"Bipartite theory and matching in Semigraphs","display_name":"Bipartite theory and matching in Semigraphs","alternate_titles":[],"publication_year":2021,"publication_date":"2021-11-11","ids":{"openalex":"https://openalex.org/W3213141013","mag":"3213141013"},"language":"en","primary_location":{"id":"mag:3213141013","doi":null,"is_oa":false,"landing_page_url":"https://rigeo.org/submit-a-menuscript/index.php/submission/article/view/2943","pdf_url":null,"source":{"id":"https://openalex.org/S4306526016","display_name":"Review of International Geographical Education Online","issn_l":"2146-0353","issn":["2146-0353"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["anvur-scientific","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":"Review of International Geographical Education Online","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W3213141013"],"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":null,"display_name":"K. Meenakshi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"K. Meenakshi","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":"11","issue":"10","first_page":"1040","last_page":"1048"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7832000255584717,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.7832000255584717,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.08630000054836273,"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.05139999836683273,"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/bipartite-graphs","display_name":"bipartite graphs","score":0.9120000004768372},{"id":"https://openalex.org/keywords/semigraphs","display_name":"semigraphs","score":0.7689999938011169},{"id":"https://openalex.org/keywords/graph-matching","display_name":"graph matching","score":0.7110000252723694},{"id":"https://openalex.org/keywords/dulmage-mendelsohn-decomposition","display_name":"Dulmage-Mendelsohn decomposition","score":0.9309999942779541},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"assignment problem","score":0.824999988079071},{"id":"https://openalex.org/keywords/maximum-matching","display_name":"maximum matching","score":0.46299999952316284}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9487835168838501},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.7609663009643555},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7096455693244934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5517522692680359},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.49837613105773926},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.47903886437416077},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.46466362476348877},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.41453564167022705},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.41452664136886597},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37559911608695984},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32869166135787964},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30220264196395874},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.28172412514686584},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.049696654081344604},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:3213141013","doi":null,"is_oa":false,"landing_page_url":"https://rigeo.org/submit-a-menuscript/index.php/submission/article/view/2943","pdf_url":null,"source":{"id":"https://openalex.org/S4306526016","display_name":"Review of International Geographical Education Online","issn_l":"2146-0353","issn":["2146-0353"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["anvur-scientific","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":"Review of International Geographical Education Online","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/W3166526009","https://openalex.org/W4250221173","https://openalex.org/W1463991495","https://openalex.org/W2502556019","https://openalex.org/W1500195281","https://openalex.org/W1976578330","https://openalex.org/W2731046538","https://openalex.org/W2469112301","https://openalex.org/W2494478116","https://openalex.org/W4415926031"],"abstract_inverted_index":{"There":[0],"are":[1,55],"a":[2],"variety":[3],"of":[4,15,58],"approaches":[5],"to":[6,40],"describe":[7],"bipartite":[8,19,47],"theory":[9],"in":[10,35,53],"graph":[11],"theory.":[12],"The":[13,31,46],"solution":[14,27],"matching":[16],"issues":[17],"on":[18,28],"graphs":[20],"is":[21],"frequently":[22],"more":[23],"straightforward":[24],"than":[25],"the":[26,42,56],"non-bipartite":[29],"graphs.":[30],"Dulmage":[32],"Mendelsohn":[33],"decomposition,":[34],"particular,":[36],"can":[37],"be":[38],"used":[39],"locate":[41],"best":[43],"possible":[44],"matches.":[45],"theory,":[48],"matchings,":[49],"and":[50],"assignment":[51],"problems":[52],"semigraphs":[54],"focus":[57],"this":[59],"paper.":[60]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3213141013","counts_by_year":[],"updated_date":"2026-09-29T14:09:16.559479","created_date":"2021-11-22T00:00:00"}
