{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:28Z","timestamp":1751282848259},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1981,6]]},"DOI":"10.1007\/bf02579270","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T22:16:08Z","timestamp":1174601768000},"page":"145-153","source":"Crossref","is-referenced-by-count":49,"title":["How to make a digraph strongly connected"],"prefix":"10.1007","volume":"1","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02579270_CR1","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"J. Edmonds andR. Giles, A min-max relation for submodular functions on graphs, in: \u201cStudies in integer programming\u201d (Proc. Workshop on Integer Programming Bonn, 1975; P. L. Hammer, E. L. Johnson, B. H. Korte, eds.),Annals of Discrete Math. 1 (1977) 185\u2013204.","journal-title":"Annals of Discrete Math."},{"key":"BF02579270_CR2","volume-title":"Flows in Networks","author":"L. R. Ford Jr.","year":"1962","unstructured":"L. R. Ford, Jr. andD. R. Fulkerson,Flows in Networks, Princeton Univ. Press, Princeton, N.J., 1962."},{"key":"BF02579270_CR3","unstructured":"A. Frank, An algorithm for submodular functions on graphs, submitted toAnnals of Discrete Math."},{"key":"BF02579270_CR4","doi-asserted-by":"crossref","unstructured":"S. Fujishige, Algorithms for solving the independent flow problems,J. Operation Res. Soc. Japan, Vol.21, No. 2, June (1978).","DOI":"10.15807\/jorsj.21.189"},{"key":"BF02579270_CR5","unstructured":"A. V. Karzanov, On the minimal number of arcs of a digraph meeting all its directed cutsets, (abstract)Graph Theory Newsletters, Vol.8 (No. 4) March 1979."},{"key":"BF02579270_CR6","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E. L. Lawler","year":"1976","unstructured":"E. L. Lawler,Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976."},{"key":"BF02579270_CR7","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/0095-8956(76)90049-6","volume":"21","author":"L. Lov\u00e1sz","year":"1976","unstructured":"L. Lov\u00e1sz, On two minimax theorems in graph theory,J. Combinatorial Theory (B)21 (1976) 96\u2013103.","journal-title":"J. Combinatorial Theory"},{"issue":"2","key":"BF02579270_CR8","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/jlms\/s2-17.3.369","volume":"17","author":"C. L. Lucchesi","year":"1978","unstructured":"C. L. Lucchesi andD. H. Younger, A minimax relation for directed graphs,J. London Math. Soc. (2)17 (1978) 369\u2013374.","journal-title":"J. London Math. Soc."},{"key":"BF02579270_CR9","volume-title":"A minimax equality for directed graphs","author":"C. L. Lucchesi","year":"1976","unstructured":"C. L. Lucchesi,A minimax equality for directed graphs, Ph. D. Thesis, Univ. of Waterloo, Waterloo, Ont. 1976."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579270.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02579270\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02579270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T16:45:00Z","timestamp":1558197900000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02579270"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["BF02579270"],"URL":"https:\/\/doi.org\/10.1007\/bf02579270","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}