{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T05:43:29Z","timestamp":1735883009600,"version":"3.32.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1007\/bf01975869","type":"journal-article","created":{"date-parts":[[2005,7,31]],"date-time":"2005-07-31T16:17:33Z","timestamp":1122826653000},"page":"256-286","source":"Crossref","is-referenced-by-count":0,"title":["Bidirectional edges problem: Part I\u2014A simple algorithm"],"prefix":"10.1007","volume":"15","author":[{"given":"B.","family":"Mishra","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"8","key":"BF01975869_CR1","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1109\/43.3214","volume":"7","author":"Z. Barzilai","year":"1988","unstructured":"Z. Barzilai, D. K. Breece, L. M. Huisman, V. S. Iyengar, and G. M. Silberman. SLS-A Fast Switch Level Simulator.IEEE Trans. Comput. Aided Design, 7(8):838\u2013849, August 1988.","journal-title":"IEEE Trans. Comput. Aided Design"},{"key":"BF01975869_CR2","volume-title":"Technical Report","author":"D. Brand","year":"1983","unstructured":"D. Brand. Detecting Sneak Paths in Transistor Networks. Technical Report, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1983."},{"key":"BF01975869_CR3","unstructured":"H. H. Chen, R. G. Mathews, and J. A. Newkirk. An Algorithm to Generate Tests for MOS Circuits at the Switch Level.Proc. International Test Conference, pp. 304\u2013312, 1985."},{"key":"BF01975869_CR4","doi-asserted-by":"crossref","unstructured":"M. A. Cirit. Switch Level Random Pattern Testability Analysis.Proc. Design Automation Conference, pp. 587\u2013590, 1988.","DOI":"10.1109\/DAC.1988.14821"},{"key":"BF01975869_CR5","first-page":"1277","volume":"11","author":"E. A. Dinic","year":"1970","unstructured":"E. A. Dinic. Algorithm for Solution of a Problem of Maximum Flow in a Network with Power Estimation.Soviet Math. Dokl., 11:1277\u20131280, 1970.","journal-title":"Soviet Math. Dokl."},{"key":"BF01975869_CR6","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"S. Even.Graph Algorithms. Computer Science Press, Rockville, MD, 1979."},{"key":"BF01975869_CR7","volume-title":"Ph.D. thesis","author":"E. Frank","year":"1985","unstructured":"E. Frank. A Data Driven Multiprocessor for Switch Level Simulation of VLSI Circuits. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA, 1985."},{"issue":"4","key":"BF01975869_CR8","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"J. Hopcroft and R. Tarjan. Efficient Planarity Testing.J. Assoc. Comput. Mach., 21(4):549\u2013568, October 1974.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"3","key":"BF01975869_CR9","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1109\/TCAD.1987.1270295","volume":"6","author":"N. P. Jouppi","year":"1987","unstructured":"N. P. Jouppi. Derivation of Signal Flow Direction in MOS VLSI.IEEE Trans. Comput. Aided Design, 6(3):480\u2013490, May 1987.","journal-title":"IEEE Trans. Comput. Aided Design"},{"key":"BF01975869_CR10","unstructured":"K. J. Lee, R. Gupta, and M. A. Breuer. An Algorithmic Method for Assigning Signal Flow Directions to MOS Transistors. Technical Report, University of Southern California, June 1990."},{"key":"BF01975869_CR11","doi-asserted-by":"crossref","unstructured":"B. Mishra. An Efficient Algorithm To Find All \u201cBidirectional\u201d Edges of an Undirected Graph. Proc.25th Annual Symposium on Foundations of Computer Science, pp. 207\u2013216, 1984.","DOI":"10.1109\/SFCS.1984.715917"},{"key":"BF01975869_CR12","volume-title":"Ph.D. thesis","author":"B. Mishra","year":"1985","unstructured":"B. Mishra. Some Graph Theoretic Issues in VLSI Design. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA, September 1985."},{"key":"BF01975869_CR13","volume-title":"Technical Report No. 647","author":"B. Mishra","year":"1993","unstructured":"B. Mishra. Bidirectional Edges Problem: Part II. An Efficient Algorithm. Technical Report No. 647, Courant Institute of Mathematical Sciences, New York, September 1993."},{"key":"BF01975869_CR14","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF01758776","volume":"7","author":"B. Mishra","year":"1992","unstructured":"B. Mishra and R.E. Tarjan. A Linear-Time Algorithm for Finding an Ambitus.Algorithmica, 7:521\u2013554, 1992.","journal-title":"Algorithmica"},{"key":"BF01975869_CR15","volume-title":"Graph Theory and Algorithms, Vol. 108","author":"T. Ohtsuki","year":"1980","unstructured":"T. Ohtsuki.The Two Disjoint Path Problem and Wire Routing Design. Graph Theory and Algorithms, Vol. 108 (Eds. N. Saito, T. Nishizeki). Springer-Verlag, New York, October 1980."},{"key":"BF01975869_CR16","volume-title":"The Four-Color Problem","author":"O. Ore","year":"1967","unstructured":"O. Ore.The Four-Color Problem. Academic Press, New York, 1967."},{"key":"BF01975869_CR17","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0012-365X(80)90158-2","volume":"29","author":"P. D. Seymour","year":"1980","unstructured":"P. D. Seymour. Disjoint Paths in Graphs.Discrete Math., 29:293\u2013309, 1980.","journal-title":"Discrete Math."},{"issue":"3","key":"BF01975869_CR18","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/322203.322207","volume":"27","author":"Y. Shiloach","year":"1980","unstructured":"Y. Shiloach. A Polynomial Solution to the Undirected Two Paths Problem.J. Assoc. Comput. Mach., 27(3):445\u2013456, July 1980.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01975869_CR19","doi-asserted-by":"crossref","DOI":"10.3138\/9781487584863","volume-title":"Connectivity in Graphs","author":"W. T. Tutte","year":"1966","unstructured":"W. T. Tutte.Connectivity in Graphs. University of Toronto Press, Toronto, 1966."},{"key":"BF01975869_CR20","doi-asserted-by":"crossref","unstructured":"W. T. Tutte. Bridges and Hamiltonian Circuits in Planar Graphs.Aequationes Math., 15, 1977.","DOI":"10.1007\/BF01837870"},{"key":"BF01975869_CR21","volume-title":"Graph Theory","author":"W. T. Tutte","year":"1984","unstructured":"W. T. Tutte.Graph Theory. Addison-Wesley, Menlo Park, Ca, 1984."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01975869.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01975869\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01975869","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T21:44:06Z","timestamp":1735854246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01975869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF01975869"],"URL":"https:\/\/doi.org\/10.1007\/bf01975869","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}