{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T17:39:46Z","timestamp":1776793186044,"version":"3.51.2"},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1985,3]]},"DOI":"10.1016\/0196-6774(85)90022-7","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"112-131","source":"Crossref","is-referenced-by-count":59,"title":["An algorithmic proof of Tutte's f-factor theorem"],"prefix":"10.1016","volume":"6","author":[{"given":"R.P","family":"Anstee","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90022-7_BIB1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0012-365X(83)90053-5","article-title":"Network flows approach to matrices with given line sums","volume":"44","author":"Anstee","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/0196-6774(85)90022-7_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0196-6774(85)90022-7_BIB3","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0196-6774(85)90022-7_BIB4","series-title":"Combinatorial Structures and Their Applications","article-title":"Matching: A well-solved class of integer linear programs, preprint","author":"Edmonds","year":"1970"},{"key":"10.1016\/0196-6774(85)90022-7_BIB5","series-title":"Proc. IEEE 16th Ann. Sympos. on Found. Comput. Sci.","first-page":"100","article-title":"An O(n2.5) algorithm for maximum matching in general graphs","author":"Even","year":"1975"},{"key":"10.1016\/0196-6774(85)90022-7_BIB6","series-title":"Flows in Networks","author":"Ford","year":"1962"},{"key":"10.1016\/0196-6774(85)90022-7_BIB7","doi-asserted-by":"crossref","first-page":"166","DOI":"10.4153\/CJM-1965-016-2","article-title":"Some properties of graphs with multiple edges","volume":"17","author":"Fulkerson","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0196-6774(85)90022-7_BIB8","first-page":"133","article-title":"On factorizations of graphs","volume":"1","author":"Gallai","year":"1950","journal-title":"Acta Math."},{"key":"10.1016\/0196-6774(85)90022-7_BIB9","series-title":"Proc. Sympos. Appl. Math.","doi-asserted-by":"crossref","DOI":"10.1090\/psapm\/010\/0114759","article-title":"Some recent applications of the theory of linear inequalities to extremal combinatorial analysis","author":"Hoffman","year":"1960"},{"key":"10.1016\/0196-6774(85)90022-7_BIB10","first-page":"434","article-title":"Determining the maximal flow in a network by the method of preflows","volume":"15","author":"Karzanov","year":"1974","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0196-6774(85)90022-7_BIB11","series-title":"Combinatorial Optimization: Networks and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0196-6774(85)90022-7_BIB12","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/S0021-9800(70)80033-3","article-title":"Subgraphs with prescribed valencies","volume":"8","author":"Lovasz","year":"1970","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0196-6774(85)90022-7_BIB13","article-title":"Matching Algorithms","author":"Marsh","year":"1979"},{"key":"10.1016\/0196-6774(85)90022-7_BIB14","series-title":"Proc. IEEE 21st Ann. Sympos. Found. Comput. Sci.","article-title":"An O(|v|12|E|) algorithm for finding maximum matchings in general graphs","author":"Micali","year":"1980"},{"key":"10.1016\/0196-6774(85)90022-7_BIB15","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0021-9800(68)80026-2","article-title":"Combinatiorial theorems and integral matrices","volume":"5","author":"Mirsky","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0196-6774(85)90022-7_BIB16","doi-asserted-by":"crossref","first-page":"462","DOI":"10.4153\/CJM-1960-040-0","article-title":"Traces of matrices of zeros and ones","volume":"12","author":"Ryser","year":"1960","journal-title":"Canad. J. Math."},{"key":"10.1016\/0196-6774(85)90022-7_BIB17","article-title":"An O(nm log n) Algorithm for Maximum Network Flow","author":"Sleator","year":"1981"},{"key":"10.1016\/0196-6774(85)90022-7_BIB18","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","article-title":"The factors of graphs","volume":"4","author":"Tutte","year":"1952","journal-title":"Canad. J. Math."},{"key":"10.1016\/0196-6774(85)90022-7_BIB19","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","article-title":"A short proof of the factor theorem for finite graphs","volume":"6","author":"Tutte","year":"1954","journal-title":"Canad. J. Math."},{"key":"10.1016\/0196-6774(85)90022-7_BIB20","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02579180","article-title":"Graph factors","volume":"1","author":"Tutte","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0196-6774(85)90022-7_BIB21","article-title":"Degree Constrained Subgraphs of Linear Graphs","author":"Urqhuart","year":"1967"},{"key":"10.1016\/0196-6774(85)90022-7_BIB22","series-title":"Proc. 15th Ann. ACM Sympos. Theory of Comput.","article-title":"An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems","author":"Gabow","year":"1983"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900227?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900227?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:26:35Z","timestamp":1548725195000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["0196677485900227"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90022-7","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}