{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T13:26:48Z","timestamp":1774531608985,"version":"3.50.1"},"reference-count":4,"publisher":"World Scientific Pub Co Pte Ltd","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p> We consider the maximum 1-2 matching problem in bipartite graphs. The notion of the augmenting trail for the 1-2 matching problem, which is the extension of the notion of the augmenting path for the 1-1 matching problem is introduced. The main purpose of the present paper is to prove \u201cthe augmenting trail theorem\u201d for the 1-2 matching problem in the bipartite graph, which is an analogue of the augmenting path theorem by Berg\u00e9 for the usual 1-1 matching problems. <\/jats:p>","DOI":"10.1142\/s1793830917500562","type":"journal-article","created":{"date-parts":[[2017,7,10]],"date-time":"2017-07-10T06:49:02Z","timestamp":1499669342000},"page":"1750056","source":"Crossref","is-referenced-by-count":2,"title":["Augmenting trail theorem for the maximum 1-2 matching problem"],"prefix":"10.1142","volume":"09","author":[{"given":"Hiroki","family":"Izumi","sequence":"first","affiliation":[{"name":"Graduate School of Engineering, Science of Environment and Mathematical Modeling, Doshisha University, 1-3 Tatara Miyakodani, Kyotanabe 610-0394, Japan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3751-5115","authenticated-orcid":false,"given":"Sennosuke","family":"Watanabe","sequence":"additional","affiliation":[{"name":"Faculty of Life and Environmental Sciences, Kyoto Prefectural University, 1-5 Hangi-cho, Shimogamo, Sakyo-ku, Kyoto 606-8522, Japan"}]},{"given":"Yoshihide","family":"Watanabe","sequence":"additional","affiliation":[{"name":"Faculty of Science and Engineering, Department of Mathematical Sciences, Doshisha University, 1-3 Tatara Miyakodani, Kyotanabe 610-0394, Japan"}]}],"member":"219","published-online":{"date-parts":[[2017,8,16]]},"reference":[{"key":"S1793830917500562BIB001","volume-title":"Network Flows","author":"Ahuja K.","year":"1993"},{"key":"S1793830917500562BIB002","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.43.9.842"},{"key":"S1793830917500562BIB003","volume-title":"Graphs, Networks and Algorithm","author":"Jungnickel D.","year":"2005"},{"key":"S1793830917500562BIB004","volume-title":"Combinatorial Optimization","author":"Korte B.","year":"2001"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830917500562","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:03:28Z","timestamp":1565096608000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830917500562"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":4,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2017,8,16]]},"published-print":{"date-parts":[[2017,8]]}},"alternative-id":["10.1142\/S1793830917500562"],"URL":"https:\/\/doi.org\/10.1142\/s1793830917500562","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8]]}}}