{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:29:03Z","timestamp":1725456543426},"publisher-location":"Berlin, Heidelberg","reference-count":76,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540513711"},{"type":"electronic","value":"9783540462019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0035768","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T09:00:28Z","timestamp":1133427628000},"page":"304-318","source":"Crossref","is-referenced-by-count":2,"title":["Parallel algorithmic techniques for combinatorial computation"],"prefix":"10.1007","author":[{"given":"David","family":"Eppstein","sequence":"first","affiliation":[]},{"given":"Zvi","family":"Galil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,11,29]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal and R.J. Anderson, A Random NC Algorithm for Depth First Search. 19th Symp. Theory of Computing, 1987, 325\u2013334.","DOI":"10.1145\/28395.28430"},{"key":"21_CR2","unstructured":"A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, 1974."},{"key":"21_CR3","unstructured":"A.V. Aho and J.D. Ullman, Principles of Compiler Design, Addison Wesley, 1977."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Koml\u00f3s, and E. Szemer\u00e9di, An O(n log n) Sorting Network. 15th Symp. Theory of Computing, 1983, 1\u20139.","DOI":"10.1145\/800061.808726"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"R.J. Anderson and G.L. Miller, A Simple Randomized Parallel Algorithm for List-Ranking. Inf. Proc. Lett., to appear.","DOI":"10.1016\/0020-0190(90)90196-5"},{"key":"21_CR6","unstructured":"R.J. Anderson and G.L. Miller, Deterministic Parallel List Ranking. 3rd Aegean Worksh. Comput., 1988, Corfu."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/0022-0000(84)90003-5","volume":"29","author":"M.J. Atallah","year":"1984","unstructured":"M.J. Atallah and U. Vishkin, Finding Euler Tours in Parallel. J. Comput. Sys. Sci. 29, 1984, 330\u2013337.","journal-title":"J. Comput. Sys. Sci."},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, A. Israeli, and Y. Shiloach, Finding Euler Circuits in Logarithmic Parallel Time. 16th Symp. Theory of Computing, 1984, 249\u2013257.","DOI":"10.1145\/800057.808688"},{"issue":"2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321812.321815","volume":"21","author":"R.P. Brent","year":"1974","unstructured":"R.P. Brent, The Parallel Evaluation of General Arithmetic Expressions. J. ACM 21(2), 1974, 201\u2013206.","journal-title":"J. ACM"},{"key":"21_CR10","first-page":"231","volume":"324","author":"B.S. Chlebus","year":"1988","unstructured":"B.S. Chlebus, K. Diks, T. Hagerup, and T. Radzik, Efficient Simulations between Concurrent-Read Concurrent-Write PRAM Models. 13th Symp. Math. Found. Comput. Sci., Springer-Verlag LNCS 324, 1988, 231\u2013239.","journal-title":"Springer-Verlag LNCS"},{"key":"21_CR11","unstructured":"B.S. Chlebus, K. Diks, T. Hagerup, and T. Radzik, New Simulations between CRCW PRAMs. Manuscript."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin, Deterministic Coin Tossing and Accelerating Cascades: Micro and Macro Techniques for Designing Parallel Algorithms. 18th Symp. Theory of Computing, 1986, 206\u2013219.","DOI":"10.1145\/12130.12151"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","volume":"70","author":"R. Cole","year":"1986","unstructured":"R. Cole and U. Vishkin, Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking. Inf. and Control 70, 1986, 32\u201353.","journal-title":"Inf. and Control"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin, Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems. 27th Symp. Found. Comput. Sci., 1986, 478\u2013491.","DOI":"10.1109\/SFCS.1986.10"},{"key":"21_CR15","unstructured":"R. Cole and U. Vishkin, Optimal Parallel Algorithms for Expression Tree Evaluation and List Ranking. 3rd Aegean Worksh. Comput., 1987, Corfu."},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"D. Coppersmith and S. Winograd, Matrix Multiplication via Arithmetic Progressions. 19th Symp. Theory of Computing, 1987, 1\u20136.","DOI":"10.1145\/28395.28396"},{"key":"21_CR17","unstructured":"D. Eppstein, Parallel Recognition of Series-Parallel Graphs. Submitted."},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"S. Even and R.E. Tarjan, Computing an st-numbering. Theor. Comput. Sci. 2, 1976, 339\u2013344.","journal-title":"Theor. Comput. Sci."},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/0217037","volume":"17","author":"F.E. Fich","year":"1988","unstructured":"F.E. Fich, R.L. Ragde, and A. Wigderson, Relations Between Concurrent-Write Models of Parallel Computation. SIAM J. Comput. 17, 1988, 606\u2013627.","journal-title":"SIAM J. Comput."},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01762109","volume":"3","author":"F.E. Fich","year":"1988","unstructured":"F.E. Fich, R.L. Radge, and A. Wigderson, Simulations Among Concurrent-Write PRAMs. Algorithmica 3, 1988, 43\u201351.","journal-title":"Algorithmica"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Z. Galil, Optimal Parallel Algorithms for String Matching. 16th Symp. Theory of Computing, 1984, 240\u2013248, and Inf. and Control 67, 1986, 144\u2013157.","DOI":"10.1016\/S0019-9958(85)80031-0"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1146\/annurev.cs.01.060186.001213","volume":"1","author":"Z. Galil","year":"1986","unstructured":"Z. Galil, Sequential and Parallel Algorithms for Finding Maximum Matchings in Graphs. Ann. Rev. Comput. Sci. 1, 1986, 197\u2013224.","journal-title":"Ann. Rev. Comput. Sci."},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Z. Galil and V. Pan, Improved Processor Bounds for Algebraic and Combinatorial Problems in RNC. 26th Symp. Found. Comput. Sci., 1985, 490\u2013495.","DOI":"10.1109\/SFCS.1985.33"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"H. Gazit, An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph. 27th Symp. Found. Comput. Sci., 1986, 492\u2013501.","DOI":"10.1109\/SFCS.1986.9"},{"key":"21_CR25","unstructured":"H. Gazit, G.L. Miller, and S.H. Teng, Optimal Tree Contraction in EREW Model. Manuscript."},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"A. Goldberg, S. Plotkin, and G. Shannon, Parallel Symmetry-Breaking in Sparse Graphs. 19th Symp. Theory of Computing, 1987, 315\u2013324.","DOI":"10.1145\/28395.28429"},{"key":"21_CR27","doi-asserted-by":"crossref","unstructured":"M. Goldberg and T. Spencer, A New Parallel Algorithm for the Maximal Independent Set Problem. 28th Symp. Found. Comput. Sci., 1987, 161\u2013165.","DOI":"10.1109\/SFCS.1987.2"},{"key":"21_CR28","doi-asserted-by":"crossref","unstructured":"V. Grolmusz and P. Ragde, Incomparibility in Parallel Computation. 28th Symp. Found. Comput. Sci., 1987, 89\u201398.","DOI":"10.1109\/SFCS.1987.34"},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0890-5401(87)90061-7","volume":"75","author":"X. He","year":"1987","unstructured":"X. He and Y. Yesha, Parallel Recognition and Decomposition of Two Terminal Series Parallel Graphs, Inf. and Comput. 75, 1987, 15\u201338.","journal-title":"Inf. and Comput."},{"issue":"12","key":"21_CR30","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1145\/7902.7903","volume":"29","author":"W.D. Hillis","year":"1986","unstructured":"W.D. Hillis and G.L. Steele, Data Parallel Algorithms. C. ACM 29(12), 1986, 1170\u20131183.","journal-title":"C. ACM"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"D.S. Hirschberg, Parallel Algorithms for the Transitive Closure and the Connected Component Problems. 8th Symp. Theory of Computing, 1976, 55\u201357.","DOI":"10.1145\/800113.803631"},{"key":"21_CR32","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(86)90144-4","volume":"22","author":"A. Israeli","year":"1986","unstructured":"A. Israeli and A. Itai, A Fast and Simple Randomized Parallel Algorithm for Maximal Matching. Inf. Proc. Lett. 22, 1986, 77\u201380.","journal-title":"Inf. Proc. Lett."},{"key":"21_CR33","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0020-0190(86)90141-9","volume":"22","author":"A. Israeli","year":"1986","unstructured":"A. Israeli and Y. Shiloach, An Improved Parallel Algorithm for Maximal Matching. Inf. Proc. Lett. 22, 1986, 57\u201360.","journal-title":"Inf. Proc. Lett."},{"key":"21_CR34","doi-asserted-by":"crossref","unstructured":"A. Kanevsky and V. Ramachandran, Improved Algorithms for Graph Four-Connectivity. 28th Symp. Found. Comput. Sci., 1987, 252\u2013259.","DOI":"10.1109\/SFCS.1987.33"},{"key":"21_CR35","doi-asserted-by":"crossref","unstructured":"A.R. Karlin and E. Upfal, Parallel Hashing \u2014 An Efficient Implementation of Shared Memory. 18th Symp. Theory of Computing, 1986, 160\u2013168.","DOI":"10.1145\/12130.12146"},{"key":"21_CR36","doi-asserted-by":"crossref","unstructured":"R.M. Karp, E. Upfal, and A. Wigderson, Constructing a Perfect Matching is in Random NC. 17th Symp. Theory of Computing, 1985, 22\u201332.","DOI":"10.1145\/22145.22148"},{"key":"21_CR37","doi-asserted-by":"crossref","unstructured":"R.M. Karp, E. Upfal, and A. Wigderson, Are Search and Decision Problems Computationally Equivalent? 17th Symp. Theory of Computing, 1985, 464\u2013483.","DOI":"10.1145\/22145.22197"},{"key":"21_CR38","doi-asserted-by":"crossref","unstructured":"P.N. Klein and J.H. Reif, An Efficient Parallel Algorithm for Planarity. 27th Symp. Found. Comput. Sci., 1986, 465\u2013477.","DOI":"10.1109\/SFCS.1986.6"},{"key":"21_CR39","first-page":"105","volume":"19","author":"A.N. Krapchenko","year":"1970","unstructured":"A.N. Krapchenko, Asymptotic Estimation of Addition Time of a Parallel Adder. English translation in Syst. Theory Res. 19, 1970, 105\u2013122.","journal-title":"Syst. Theory Res."},{"key":"21_CR40","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","volume":"C-34","author":"C.P. Kruskal","year":"1985","unstructured":"C.P. Kruskal, L. Rudolph, and M. Snir, The Power of Parallel Prefix. IEEE Trans. Comput. C-34, 1985, 965\u2013968.","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"21_CR41","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0020-0190(82)90093-X","volume":"14","author":"L. Ku\u010dera","year":"1982","unstructured":"L. Ku\u010dera, Parallel Computation and Conflicts in Memory Access. Inf. Proc. Lett. 14(2), 1982, 93\u201396.","journal-title":"Inf. Proc. Lett."},{"issue":"4","key":"21_CR42","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R.E. Ladner","year":"1980","unstructured":"R.E. Ladner and M.J. Fischer, Parallel Prefix Computation. J. ACM 27(4), 1980, 831\u2013838.","journal-title":"J. ACM"},{"key":"21_CR43","doi-asserted-by":"crossref","unstructured":"N. Linial, L. Lov\u00e1sz, and A. Wigderson, A Geometric Interpretation of Graph Connectivity and its Algorithmic Applications. 27th Symp. Found. Comput. Sci., 1986, 39\u201348.","DOI":"10.1109\/SFCS.1986.3"},{"key":"21_CR44","doi-asserted-by":"crossref","unstructured":"L. Lov\u00e1sz, Computing Ears and Branchings in Parallel. 26th Symp. Found. Comput. Sci., 1985, 464\u2013467.","DOI":"10.1109\/SFCS.1985.16"},{"key":"21_CR45","doi-asserted-by":"crossref","unstructured":"M. Luby, A Simple Parallel Algorithm for the Maximal Independent Set Problem. 17th Symp. Theory of Computing, 1985, 1\u201310.","DOI":"10.1145\/22145.22146"},{"key":"21_CR46","first-page":"34","volume":"227","author":"Y. Maon","year":"1986","unstructured":"Y. Maon, B. Schieber, and U. Vishkin, Parallel Ear Decomposition Search (EDS) and ST-Numbering in Graphs. VLSI Alg. and Arch., Springer-Verlag LNCS 227, 1986, 34\u201345.","journal-title":"Springer-Verlag LNCS"},{"issue":"4","key":"21_CR47","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms. J. ACM 30(4), 1983, 852\u2013865.","journal-title":"J. ACM"},{"key":"21_CR48","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00264615","volume":"21","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn and U. Vishkin, Randomized and Deterministic Simulations of PRAMs by Parallel Machines with Restricted Granularity of Parallel Memories. Acta Informatica 21, 1984, 339\u2013374.","journal-title":"Acta Informatica"},{"key":"21_CR49","doi-asserted-by":"crossref","unstructured":"S. Micali and V.V. Vazirani, An O(\u2192|V||E|) Algorithm for Finding Maximum Matchings in General Graphs. 21st Symp. Found. Comput. Sci., 1980, 17\u201327.","DOI":"10.1109\/SFCS.1980.12"},{"key":"21_CR50","unstructured":"G.L. Miller and V. Ramachandran, Efficient Parallel Ear Decomposition with Applications. Manuscript."},{"key":"21_CR51","doi-asserted-by":"crossref","unstructured":"G.L. Miller and V. Ramachandran, A New Graph Triconnectivity Algorithm and Its Parallelization. 19th Symp. Theory of Computing, 1987, 335\u2013344.","DOI":"10.1145\/28395.28431"},{"key":"21_CR52","doi-asserted-by":"crossref","unstructured":"G.L. Miller and J.H. Reif, Parallel Tree Contraction and its Application. 26th Symp. Found. Comput. Sci., 1985, 478\u2013489.","DOI":"10.1109\/SFCS.1985.43"},{"key":"21_CR53","doi-asserted-by":"crossref","unstructured":"K. Mulmuley, U.V. Vazirani, and V.V. Vazirani, Matching is as Easy as Matrix Inversion. 19th Symp. Theory of Computing, 1987, 345\u2013354, and Combinatorica 7, 1, 1987, 105\u2013114.","DOI":"10.1145\/28395.383347"},{"key":"21_CR54","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","volume":"C-30","author":"D. Nassimi","year":"1981","unstructured":"D. Nassimi and S. Sahni, Data Broadcasting SIMD Computers. IEEE Trans. Comput. C-30, 1981, 101\u2013107.","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"21_CR55","first-page":"48","volume":"145","author":"Y.P. Offman","year":"1962","unstructured":"Y.P. Offman, On the Algorithmic Complexity of Discrete Functions. Dokl. Sov. Acad. Sci. 145(1), 1962, 48\u201351. English translation in Sov. Phys. Dokl. 7(7), 1963, 589\u2013591.","journal-title":"Dokl. Sov. Acad. Sci."},{"issue":"3","key":"21_CR56","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/0020-0190(78)90079-0","volume":"7","author":"F.P. Preparata","year":"1978","unstructured":"F.P. Preparata and D.V. Sarwati, An Improved Parallel Processor Bound in Fast Matrix Inversion. Inf. Proc. Lett. 7(3), 1978, 148\u2013150.","journal-title":"Inf. Proc. Lett."},{"key":"21_CR57","doi-asserted-by":"crossref","unstructured":"V. Ramachandran and U. Vishkin, Efficient Parallel Triconnectivity in Logarithmic Time. 3rd Aegean Worksh. Comput., 1987, Corfu.","DOI":"10.1007\/BFb0040371"},{"key":"21_CR58","doi-asserted-by":"crossref","unstructured":"A.G. Ranade, How to Emulate Shared Memory. 28th Symp. Found. Comput. Sci., 1987, 185\u2013194.","DOI":"10.1109\/SFCS.1987.32"},{"key":"21_CR59","unstructured":"J.H. Reif, Probabilistic Parallel Prefix Computation. Manuscript."},{"key":"21_CR60","doi-asserted-by":"crossref","unstructured":"J.H. Reif, An Optimal Parallel Algorithm for Integer Sorting. 26th Symp. Found. Comput. Sci., 1985, 496\u2013504.","DOI":"10.1109\/SFCS.1985.9"},{"key":"21_CR61","unstructured":"B. Schieber, Design and Analysis of some Parallel Algorithms. Ph.D. Dissertation, 1987, Tel Aviv University."},{"key":"21_CR62","series-title":"Ultracomputer Note","volume-title":"On Finding Lowest Common Ancestors: Simplification and Parallelization","author":"B. Schieber","year":"1987","unstructured":"B. Schieber and U. Vishkin, On Finding Lowest Common Ancestors: Simplification and Parallelization. Ultracomputer Note 118, 1987, Courant Institute, New York University, New York."},{"key":"21_CR63","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1145\/357114.357116","volume":"2","author":"J.T. Schwartz","year":"1980","unstructured":"J.T. Schwartz, Ultracomputers. ACM Trans. Prog. Lang. and Sys. 2, 1980, 484\u2013521.","journal-title":"ACM Trans. Prog. Lang. and Sys."},{"key":"21_CR64","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and U. Vishkin, Finding the Maximum, Merging and Sorting in a Parallel Computation Model. J. Algorithms 2, 1981, 88\u2013102.","journal-title":"J. Algorithms"},{"key":"21_CR65","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1109\/TC.1977.1674728","volume":"C-26","author":"M. Snir","year":"1977","unstructured":"M. Snir and A.B. Barak, A Direct Approach to the Parallel Evaluation of Rational Expressions with a Small Number of Processors. IEEE Trans. Comput. C-26, 1977, 933\u2013937.","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"21_CR66","first-page":"814","volume":"15","author":"R.E. Tarjan","year":"1972","unstructured":"R.E. Tarjan, Depth-first Search and Linear Graph Algorithms. SIAM J. Comput. 15(3), 1972, 814\u2013830.","journal-title":"SIAM J. Comput."},{"key":"21_CR67","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan and U. Vishkin, Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time. 25th Symp. Found. Comput. Sci., 1984, 12\u201320.","DOI":"10.1109\/SFCS.1984.715896"},{"key":"21_CR68","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0020-0190(85)90082-1","volume":"20","author":"Y.H. Tsin","year":"1985","unstructured":"Y.H. Tsin, An Optimal Parallel Processor Bound Strong Orientation of an Undirected Graph. Inf. Proc. Lett. 20, 1985, 143\u2013146.","journal-title":"Inf. Proc. Lett."},{"issue":"3","key":"21_CR69","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L.G. Valiant","year":"1975","unstructured":"L.G. Valiant, Parallelism in Comparison Problems. SIAM J. Comput. 4(3), 1975, 348\u2013355.","journal-title":"SIAM J. Comput."},{"key":"21_CR70","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","volume":"4","author":"U. Vishkin","year":"1983","unstructured":"U. Vishkin, Implementation of Simulations Memory Access Models that Forbid it. J. Algorithms 4, 1983, 45\u201350.","journal-title":"J. Algorithms"},{"key":"21_CR71","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0304-3975(84)90028-8","volume":"32","author":"U. Vishkin","year":"1984","unstructured":"U. Vishkin, A Parallel-Design Distributed-Implementation (PDDI) General-Purpose Computer. Theor. Comput. Sci. 32, 1984, 157\u2013172.","journal-title":"Theor. Comput. Sci."},{"key":"21_CR72","doi-asserted-by":"crossref","unstructured":"U. Vishkin, Randomized Speed-ups in Parallel Computation. 16th Symp. Theory of Computing, 1984, 230\u2013239.","DOI":"10.1145\/800057.808686"},{"key":"21_CR73","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0020-0190(85)90025-0","volume":"20","author":"U. Vishkin","year":"1985","unstructured":"U. Vishkin, On Efficient Parallel Strong Orientation. Inf. Proc. Lett. 20, 1985, 235\u2013240.","journal-title":"Inf. Proc. Lett."},{"key":"21_CR74","unstructured":"J. von zur Gathen, Parallel Algebraic Computations. Unpublished course notes, 1984."},{"key":"21_CR75","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","volume":"34","author":"H. Whitney","year":"1932","unstructured":"H. Whitney, Non-Separable and Planar Graphs. Trans. AMS 34, 1932, 339\u2013362.","journal-title":"Trans. AMS"},{"key":"21_CR76","series-title":"Tech. Rep.","volume-title":"The Complexity of Parallel Computation","author":"J.C. Wyllie","year":"1979","unstructured":"J.C. Wyllie, The Complexity of Parallel Computation. Tech. Rep. TR 79\u2013387, 1979, Dept. of Computer Science, Cornell University, Ithaca, New York."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0035768","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:32:50Z","timestamp":1586593970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0035768"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540513711","9783540462019"],"references-count":76,"URL":"https:\/\/doi.org\/10.1007\/bfb0035768","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}