{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T01:01:29Z","timestamp":1648947689668},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540405054","type":"print"},{"value":"9783540450665","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45066-1_17","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T12:41:13Z","timestamp":1172666473000},"page":"215-224","source":"Crossref","is-referenced-by-count":10,"title":["On Algebraic Expressions of Series-Parallel and Fibonacci Graphs"],"prefix":"10.1007","author":[{"given":"Mark","family":"Korenblit","sequence":"first","affiliation":[]},{"given":"Vadim E.","family":"Levit","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"issue":"6","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1137\/0221065","volume":"21","author":"W.W. Bein","year":"1992","unstructured":"W.W. Bein, J. Kamburowski, and M.F.M. Stallmann, Optimal Reduction of Two-Terminal Directed Acyclic Graphs, SIAM Journal of Computing, Vol. 21, No 6, 1992, 1112\u20131129.","journal-title":"SIAM Journal of Computing"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0166-218X(00)00212-2","volume":"105","author":"P. Butkovic","year":"2000","unstructured":"P. Butkovic, Simple Image Set of (max, +) Linear Mappings, Discrete Applied Mathematics 105, 2000, 237\u2013246.","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR3","volume-title":"Introduction to Algorithms","author":"Th.H. Cormen","year":"1994","unstructured":"Th.H. Cormen, Ch.E. Leiseron, and R.L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, Massachusetts, 1994."},{"key":"17_CR4","series-title":"Lect Notes Comput Sci","first-page":"151","volume-title":"Graph-Theoretic Concepts in Computer Science, Proc. 22nd Int. Workshop, WG\u2019 96","author":"Hr.N. Djidjev","year":"1996","unstructured":"Hr.N. Djidjev, Efficient Algorithms for Shortest Path Queries in Planar Digraphs, in: Graph-Theoretic Concepts in Computer Science, Proc. 22nd Int. Workshop, WG\u2019 96, LNCS 1197, Springer, 1996, 151\u2013165."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"R.J. Duffin","year":"1965","unstructured":"R.J. Duffin, Topology of Series-Parallel Networks, Journal of Mathematical Analysis and Applications 10, 1965, 303\u2013318.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"17_CR6","unstructured":"M.Ch. Golumbic and A. Mintz, Factoring Logic Functions Using Graph Partitioning, in: Proc. IEEE\/ACM Int. Conf. Computer Aided Design, November 1999, 109\u2013114."},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"M.Ch. Golumbic, A. Mintz, and U. Rotics, Factoring and Recognition of Read-Once Functions using Cographs and Normality, in: Proc. 38th Design Automation Conf., June 2001, 195\u2013198.","DOI":"10.1145\/378239.378356"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0012-365X(79)90131-6","volume":"28","author":"M.Ch. Golumbic","year":"1979","unstructured":"M.Ch. Golumbic and Y. Perl, Generalized Fibonacci Maximum Path Graphs, Discrete Mathematics 28, 1979, 237\u2013245.","journal-title":"Discrete Mathematics"},{"key":"17_CR9","unstructured":"V.E. Levit and M. Korenblit, Symbolic PERT and its Generalization, in: Intelligent Scheduling of Robots and Flexible Manufacturing Systems, Proc. Int. Workshop held at the Center for Technological Education Holon, Israel, July 1995, 65\u201380."},{"key":"17_CR10","first-page":"113","volume-title":"Intelligent Scheduling of Robots and Flexible Manufacturing Systems","author":"V.E. Levit","year":"1996","unstructured":"V.E. Levit and M. Korenblit, A Symbolic Approach to Scheduling of Robotic Lines, in: Intelligent Scheduling of Robots and Flexible Manufacturing Systems, The Center for Technological Education Holon, Israel, 1996, 113\u2013125."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(89)90150-3","volume":"66","author":"D. Mundici","year":"1989","unstructured":"D. Mundici, Functions Computed by Monotone Boolean Formulas with no Repeated Variables, Theoretical Computer Science 66, 1989, 113\u2013114.","journal-title":"Theoretical Computer Science"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0196-8858(91)90030-M","volume":"12","author":"D. Mundici","year":"1991","unstructured":"D. Mundici, Solution of Rota\u2019s Problem on the Order of Series-Parallel Networks, Advances in Applied Mathematics 12, 1991, 455\u2013463.","journal-title":"Advances in Applied Mathematics"},{"key":"17_CR13","series-title":"Lect Notes Comput Sci","first-page":"269","volume-title":"Graph-Theoretic Concepts in Computer Science, Proc. 20th Int. Workshop, WG\u2019 94","author":"V. Naumann","year":"1994","unstructured":"V. Naumann, Measuring the Distance to Series-Parallelity by Path Expressions, in: Graph-Theoretic Concepts in Computer Science, Proc. 20th Int. Workshop, WG\u2019 94, LNCS 903, Springer, 1994, 269\u2013281."},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1002\/(SICI)1098-2418(199810\/12)13:3\/4<349::AID-RSA9>3.0.CO;2-V","volume":"13","author":"P. Savicky","year":"1998","unstructured":"P. Savicky and A.R. Woods, The Number of Boolean Functions Computed by Formulas of a Given Size, Random Structures and Algorithms 13, 1998, 349\u2013382.","journal-title":"Random Structures and Algorithms"},{"key":"17_CR15","unstructured":"B. Schoenmakers, A New Algorithm for the Recognition of Series Parallel Graphs, Report CS-R9504, ISSN 0169-118X, CWI, Amsterdam, The Netherlands, 1995."},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R.E. Tarjan, and E.L. Lawler, The Recognition of Series Parallel Digraphs, SIAM Journal of Computing, Vol. 11, No 2, 1982, 298\u2013313.","journal-title":"SIAM Journal of Computing"},{"key":"17_CR17","volume-title":"Algorithms for Multilevel Logic Optimization","author":"A.R.R. Wang","year":"1989","unstructured":"A.R.R. Wang, Algorithms for Multilevel Logic Optimization, Ph.D. Thesis, University of California, Berkeley, 1989."}],"container-title":["Discrete Mathematics and Theoretical Computer Science","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45066-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T20:03:09Z","timestamp":1548100989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45066-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405054","9783540450665"],"references-count":17,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-45066-1_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[2003]]}}}