{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T03:45:34Z","timestamp":1760586334660,"version":"3.32.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Electron Test"],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bf00993315","type":"journal-article","created":{"date-parts":[[2005,1,14]],"date-time":"2005-01-14T18:06:31Z","timestamp":1105725991000},"page":"71-81","source":"Crossref","is-referenced-by-count":41,"title":["An optimal algorithm for cycle breaking in directed graphs"],"prefix":"10.1007","volume":"7","author":[{"given":"Tatiana","family":"Orenstein","sequence":"first","affiliation":[]},{"given":"Zvi","family":"Kohavi","sequence":"additional","affiliation":[]},{"given":"Irith","family":"Pomeranz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/0022-0000(88)90009-8","volume":"37","author":"E.L. Lloyd","year":"1988","unstructured":"E.L. Lloyd and M.L. Soffa, ?On locating minimum feedback vertex sets,?Journal of Computer and System Science, Vol. 37, pp. 292?311, 1988.","journal-title":"Journal of Computer and System Science"},{"issue":"No. 1","key":"CR2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/TCS.1975.1083961","volume":"22","author":"G.W. Smith","year":"1975","unstructured":"G.W. Smith and R.B. Walford, ?The identification of a minimal feedback vertex set of a directed graph,?IEEE Transactions on Circuits and Systems, Vol. CAS-22, No. 1 pp. 9?14, January 1975).","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1109\/TCT.1963.1082116","volume":"10","author":"D.H. Younger","year":"1963","unstructured":"D.H. Younger, ?Minimum feedback are set for a directed graph,?IEEE Transactions on Circuit Theory, Vol. CT-10, pp. 238?245, June 1963.","journal-title":"IEEE Transactions on Circuit Theory"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, ?Reducibility between combinatorial problems,?Complexity of Computer Computations, R.E. Miller and J.W. Thatcher (Eds.), New York: Plenum Press, pp. 85?103, 1972."},{"key":"CR5","volume-title":"Digital Logic Testing and Simulations","author":"A. Miczo","year":"1986","unstructured":"A. Miczo,Digital Logic Testing and Simulations, New York: Harper and Row, 1986."},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"D.H. Lee and S.M. Reddy, ?On determining scan flip-flops in partial-scan designs,? inProc. of the International Conference on Computer-Aided Design, pp. 322?325, 1990.","DOI":"10.1109\/ICCAD.1990.129914"},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"H. Levy and D.W. Low, ?A contraction algorithm for finding small cycle cutsets,?Journal of Algorithms, pp. 470?493, September 1988.","DOI":"10.1016\/0196-6774(88)90013-2"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"V. Chickermane, J. Lee, and J.H. Patel, ?Design for testability using architectural description,? inProc. of the International Test Conference, pp. 752?761, 1992.","DOI":"10.1109\/TEST.1992.527897"},{"key":"CR9","unstructured":"F. Brglez, D. Bryan, and K. Kozminski, ?Combinational profiles of sequential benchmark circuits,? inProc. of the IEEE International Symposium on Circuits and Systems, pp. 1929?1934, 1989."},{"issue":"No. 4","key":"CR10","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1109\/12.54847","volume":"39","author":"K.-T. Cheng","year":"1990","unstructured":"K.-T. Cheng and V.D. Agrawal, ?A partial scan method for sequential circuits with feedback,?IEEE Transactions on Computers, Vol. 39, No. 4, pp. 544?548, April 1990.","journal-title":"IEEE Transactions on Computers"},{"key":"CR11","unstructured":"T. Orenstein, MSC Thesis. Dept. of Comp. Science, Technion, February 1992."},{"issue":"No. 2","key":"CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. Tarjan","year":"1972","unstructured":"R. Tarjan, ?Depth-first search and linear graph algorithms,?SIAM J. Comput, Vol. 1, No. 2, pp. 146?160, June 1972.","journal-title":"SIAM J. Comput"}],"container-title":["Journal of Electronic Testing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00993315.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00993315\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00993315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,22]],"date-time":"2024-12-22T16:15:47Z","timestamp":1734884147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00993315"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995]]}},"alternative-id":["BF00993315"],"URL":"https:\/\/doi.org\/10.1007\/bf00993315","relation":{},"ISSN":["0923-8174","1573-0727"],"issn-type":[{"type":"print","value":"0923-8174"},{"type":"electronic","value":"1573-0727"}],"subject":[],"published":{"date-parts":[[1995]]}}}