{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:45:41Z","timestamp":1648773941327},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,11,1]],"date-time":"1984-11-01T00:00:00Z","timestamp":468115200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10485,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1984,11]]},"DOI":"10.1016\/0166-218x(84)90026-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"263-268","source":"Crossref","is-referenced-by-count":0,"title":["A perfect matching algorithm for sparse bipartite graphs"],"prefix":"10.1016","volume":"9","author":[{"given":"Eugeniusz","family":"Toczy\u0142owski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0166-218X(84)90026-X_BIB1","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/PROC.1977.10514","article-title":"A survey of sparse matrix research","volume":"65","author":"Duff","year":"1977","journal-title":"Proc. IEEE"},{"key":"10.1016\/0166-218X(84)90026-X_BIB2","doi-asserted-by":"crossref","first-page":"1747","DOI":"10.1287\/opre.19.7.1747","article-title":"An improvement algorithm for the bottleneck assignment problem","volume":"19","author":"Garfinkel","year":"1971","journal-title":"Operations Res."},{"issue":"4","key":"10.1016\/0166-218X(84)90026-X_BIB3","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matchings in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(84)90026-X_BIB4","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(84)90026-X_BIB5","series-title":"Large-Scale Linear Programming","article-title":"Block triangularization and exploitation of dual degeneracy in the dual simplex method","author":"Toczy\u0142owski","year":"1981"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X8490026X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X8490026X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:53:00Z","timestamp":1555120380000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X8490026X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,11]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,11]]}},"alternative-id":["0166218X8490026X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(84)90026-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1984,11]]}}}