{"id":"https://openalex.org/W2734465089","doi":"https://doi.org/10.1142/s1793830917500562","title":"Augmenting trail theorem for the maximum 1-2 matching problem","display_name":"Augmenting trail theorem for the maximum 1-2 matching problem","publication_year":2017,"publication_date":"2017-07-10","ids":{"openalex":"https://openalex.org/W2734465089","doi":"https://doi.org/10.1142/s1793830917500562","mag":"2734465089"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830917500562","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830917500562","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 Engineering, Science of Environment and Mathematical Modeling, Doshisha University, 1-3 Tatara Miyakodani, Kyotanabe 610-0394, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering, Science of Environment and Mathematical Modeling, Doshisha University, 1-3 Tatara Miyakodani, Kyotanabe 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/I169719367","display_name":"Kyoto Prefectural University","ror":"https://ror.org/00ktqrd38","country_code":"JP","type":"education","lineage":["https://openalex.org/I169719367"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Sennosuke Watanabe","raw_affiliation_strings":["Faculty of Life and Environmental Sciences, Kyoto Prefectural University, 1-5 Hangi-cho, Shimogamo, Sakyo-ku, Kyoto 606-8522, Japan"],"raw_orcid":"https://orcid.org/0000-0003-3751-5115","affiliations":[{"raw_affiliation_string":"Faculty of Life and Environmental Sciences, Kyoto Prefectural University, 1-5 Hangi-cho, Shimogamo, Sakyo-ku, Kyoto 606-8522, Japan","institution_ids":["https://openalex.org/I169719367"]}]},{"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 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 610-0394, Japan","institution_ids":["https://openalex.org/I133984924"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5016867811"],"corresponding_institution_ids":["https://openalex.org/I133984924"],"apc_list":null,"apc_paid":null,"fwci":0.2193,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.57582712,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"09","issue":"04","first_page":"1750056","last_page":"1750056"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9918000102043152,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9918000102043152,"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.9846000075340271,"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.9747999906539917,"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-graph","display_name":"Bipartite graph","score":0.8781238198280334},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7952873706817627},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.7660465836524963},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.7534552812576294},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5315748453140259},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5223920345306396},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5211772322654724},{"id":"https://openalex.org/keywords/optimal-matching","display_name":"Optimal matching","score":0.4770197868347168},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45671549439430237},{"id":"https://openalex.org/keywords/robertson\u2013seymour-theorem","display_name":"Robertson\u2013Seymour theorem","score":0.419107586145401},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4016573429107666},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12265273928642273},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11422327160835266},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.08652946352958679}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8781238198280334},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7952873706817627},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.7660465836524963},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.7534552812576294},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5315748453140259},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5223920345306396},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5211772322654724},{"id":"https://openalex.org/C123853557","wikidata":"https://www.wikidata.org/wiki/Q7098946","display_name":"Optimal matching","level":3,"score":0.4770197868347168},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45671549439430237},{"id":"https://openalex.org/C173644813","wikidata":"https://www.wikidata.org/wiki/Q3527155","display_name":"Robertson\u2013Seymour theorem","level":5,"score":0.419107586145401},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4016573429107666},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12265273928642273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11422327160835266},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.08652946352958679},{"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/s1793830917500562","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830917500562","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":2,"referenced_works":["https://openalex.org/W2048652909","https://openalex.org/W4297399141"],"related_works":["https://openalex.org/W4316652266","https://openalex.org/W3181584291","https://openalex.org/W2567825307","https://openalex.org/W2054458431","https://openalex.org/W1592682627","https://openalex.org/W2184969544","https://openalex.org/W4295762832","https://openalex.org/W4312051281","https://openalex.org/W4205756423","https://openalex.org/W2734465089"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,13,17,23,26,29,33,43,54,59,67,74],"maximum":[3],"1-2":[4,18,55],"matching":[5,19,35,56,77],"problem":[6,36,57],"in":[7,58],"bipartite":[8,60],"graphs.":[9],"The":[10,39],"notion":[11,27],"of":[12,25,28,42,66],"augmenting":[14,30,50,68],"trail":[15,51],"for":[16,32,53,73],"problem,":[20],"which":[21,62],"is":[22,37,46,63],"extension":[24],"path":[31,69],"1-1":[34,76],"introduced.":[38],"main":[40],"purpose":[41],"present":[44],"paper":[45],"to":[47],"prove":[48],"\u201cthe":[49],"theorem\u201d":[52],"graph,":[61],"an":[64],"analogue":[65],"theorem":[70],"by":[71],"Berg\u00e9":[72],"usual":[75],"problems.":[78]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}