{"id":"https://openalex.org/W2966673134","doi":"https://doi.org/10.1142/s1793830919500502","title":"The maximum 1-2 matching problem and two kinds of its variants","display_name":"The maximum 1-2 matching problem and two kinds of its variants","publication_year":2019,"publication_date":"2019-08-01","ids":{"openalex":"https://openalex.org/W2966673134","doi":"https://doi.org/10.1142/s1793830919500502","mag":"2966673134"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830919500502","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830919500502","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-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/A5016867811","display_name":"Hiroki Izumi","orcid":null},"institutions":[{"id":"https://openalex.org/I133984924","display_name":"Doshisha University","ror":"https://ror.org/01fxdkm29","country_code":"JP","type":"education","lineage":["https://openalex.org/I133984924"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Hiroki Izumi","raw_affiliation_strings":["Graduate School of Science and Engineering, Science of Environment and Mathematical Modeling, Doshisha University, 1-3 Tatara Miyakodani, Kyotanabe, Kyoto 610-0394, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Engineering, Science of Environment and Mathematical Modeling, Doshisha University, 1-3 Tatara Miyakodani, Kyotanabe, Kyoto 610-0394, Japan","institution_ids":["https://openalex.org/I133984924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054432522","display_name":"Yuki Nishida","orcid":"https://orcid.org/0000-0002-7345-1334"},"institutions":[{"id":"https://openalex.org/I133984924","display_name":"Doshisha University","ror":"https://ror.org/01fxdkm29","country_code":"JP","type":"education","lineage":["https://openalex.org/I133984924"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuki Nishida","raw_affiliation_strings":["Graduate School of Science and Engineering, Science of Environment and Mathematical Modeling, Doshisha University, 1-3 Tatara Miyakodani, Kyotanabe, Kyoto 610-0394, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Science and Engineering, Science of Environment and Mathematical Modeling, Doshisha University, 1-3 Tatara Miyakodani, Kyotanabe, Kyoto 610-0394, Japan","institution_ids":["https://openalex.org/I133984924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102859639","display_name":"Sennosuke Watanabe","orcid":"https://orcid.org/0000-0003-3751-5115"},"institutions":[{"id":"https://openalex.org/I4210137284","display_name":"National Institute of Technology, Oyama College","ror":"https://ror.org/040mta007","country_code":"JP","type":"education","lineage":["https://openalex.org/I4210120810","https://openalex.org/I4210137284"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Sennosuke Watanabe","raw_affiliation_strings":["National Institute of Technology, Oyama College, 771 Nakakuki, Oyama, Tochigi 323-0806, Japan"],"raw_orcid":"https://orcid.org/0000-0003-3751-5115","affiliations":[{"raw_affiliation_string":"National Institute of Technology, Oyama College, 771 Nakakuki, Oyama, Tochigi 323-0806, Japan","institution_ids":["https://openalex.org/I4210137284"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052736282","display_name":"Yoshihide Watanabe","orcid":"https://orcid.org/0000-0001-9999-0486"},"institutions":[{"id":"https://openalex.org/I133984924","display_name":"Doshisha University","ror":"https://ror.org/01fxdkm29","country_code":"JP","type":"education","lineage":["https://openalex.org/I133984924"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshihide Watanabe","raw_affiliation_strings":["Faculty of Science and Engineering, Department of Mathematical Sciences, Doshisha University, 1-3 Tatara Miyakodani, Kyotanabe, Kyoto 610-0394, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Science and Engineering, Department of Mathematical Sciences, Doshisha University, 1-3 Tatara Miyakodani, Kyotanabe, Kyoto 610-0394, Japan","institution_ids":["https://openalex.org/I133984924"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5016867811"],"corresponding_institution_ids":["https://openalex.org/I133984924"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10588357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"05","first_page":"1950050","last_page":"1950050"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9775000214576721,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9775000214576721,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.972599983215332,"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/T12288","display_name":"Optimization and Search Problems","score":0.972000002861023,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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-graph","display_name":"Bipartite graph","score":0.9212830066680908},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8210076689720154},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.8206901550292969},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.8002068400382996},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7345892786979675},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.5274444222450256},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5157027840614319},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.46326401829719543},{"id":"https://openalex.org/keywords/optimal-matching","display_name":"Optimal matching","score":0.4175771474838257},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.4105972647666931},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40469515323638916},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2688671946525574},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.18012946844100952},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10175296664237976},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.09285783767700195}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9212830066680908},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8210076689720154},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.8206901550292969},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.8002068400382996},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7345892786979675},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.5274444222450256},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5157027840614319},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.46326401829719543},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.4175771474838257},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.4105972647666931},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40469515323638916},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2688671946525574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.18012946844100952},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10175296664237976},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.09285783767700195},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830919500502","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830919500502","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2048652909","https://openalex.org/W2734465089","https://openalex.org/W4233756358","https://openalex.org/W4297399141"],"related_works":["https://openalex.org/W2077309407","https://openalex.org/W1592682627","https://openalex.org/W2367674792","https://openalex.org/W2373360128","https://openalex.org/W4295762832","https://openalex.org/W2145951040","https://openalex.org/W1519280321","https://openalex.org/W1536296221","https://openalex.org/W3133897873","https://openalex.org/W2184969544"],"abstract_inverted_index":{"We":[0],"present":[1,109],"an":[2,116],"algorithm":[3,80],"for":[4,123],"solving":[5,18],"the":[6,19,32,39,45,53,56,62,84,94,103,110,124],"maximum":[7,33,40,57,85,95,125],"1-2":[8,34,41,58,86,126],"matching":[9,21,35,42,59,87,97,127],"problem":[10,43,60,88,98],"in":[11,22,48,65,99],"bipartite":[12,50,67,100],"graphs":[13,51],"by":[14,77,89],"reducing":[15,90],"it":[16,91],"to":[17,74,81,92],"1-1":[20,96],"general":[23],"undirected":[24],"graphs.":[25,68,101],"Further,":[26],"we":[27,106],"propose":[28],"two":[29],"variants":[30],"of":[31,44,61,83,118],"problem:":[36],"one":[37,71],"is":[38,55,72,115],"different":[46],"kind":[47,64],"divided":[49,66],"and":[52],"other":[54],"same":[63],"The":[69],"former":[70],"shown":[73],"be":[75],"solved":[76],"a":[78],"similar":[79],"that":[82],"solve":[93],"For":[102],"latter":[104],"one,":[105],"can":[107],"only":[108],"augmenting":[111,120],"subgraph":[112],"theorem,":[113],"which":[114],"extension":[117],"our":[119],"trail":[121],"theorem":[122],"problem.":[128]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}