{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T22:51:17Z","timestamp":1767826277659,"version":"3.49.0"},"reference-count":5,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":4850,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1993,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Let <jats:italic>G<\/jats:italic> = <jats:italic>(V,E)<\/jats:italic> be an undirected graph having an edge weight <jats:italic>w<\/jats:italic><jats:sub><jats:italic>e<\/jats:italic><\/jats:sub> \u2265 0 for each <jats:italic>e<\/jats:italic> \u03f5 <jats:italic>E<\/jats:italic>. An edge is called a most vital edge (with respect to weighted matching) if its removal from <jats:italic>G<\/jats:italic> results in the largest decrease in the total weight of the maximum weighted matching. In this paper, we study the most vital edges of matching in a weighted bipartite graph. We present an <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic><jats:sup>3<\/jats:sup>) algorithm to obtain the most vital edges. \u00a9 <jats:italic>1993 by John Wiley &amp; Sons, Inc.<\/jats:italic><\/jats:p>","DOI":"10.1002\/net.3230230413","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T14:48:10Z","timestamp":1178981290000},"page":"309-313","source":"Crossref","is-referenced-by-count":4,"title":["The most vital edges of matching in a bipartite graph"],"prefix":"10.1002","volume":"23","author":[{"given":"Chun\u2010Nan","family":"Hung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lih\u2010Hsing","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting\u2010Yi","family":"Sung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(82)90020-7"},{"key":"e_1_2_1_4_2","volume-title":"Graphs and Algorithms","author":"Gondran M.","year":"1984"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90028-G"},{"key":"e_1_2_1_6_2","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler E. L.","year":"1976"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230230413","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230230413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T03:38:02Z","timestamp":1698205082000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230230413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":5,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["10.1002\/net.3230230413"],"URL":"https:\/\/doi.org\/10.1002\/net.3230230413","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}