{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:19:14Z","timestamp":1725815954743},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_19","type":"book-chapter","created":{"date-parts":[[2015,1,27]],"date-time":"2015-01-27T20:23:50Z","timestamp":1422390230000},"page":"193-204","source":"Crossref","is-referenced-by-count":0,"title":["Algebraic Expressions of Rhomboidal Graphs"],"prefix":"10.1007","author":[{"given":"Mark","family":"Korenblit","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5439","key":"19_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.-L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of Scaling in Random Networks. Science\u00a0286(5439), 509\u2013512 (1999)","journal-title":"Science"},{"issue":"6","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1112","DOI":"10.1137\/0221065","volume":"21","author":"W.W. Bein","year":"1992","unstructured":"Bein, W.W., Kamburowski, J., Stallmann, M.F.M.: Optimal Reduction of Two-Terminal Directed Acyclic Graphs. SIAM Journal of Computing\u00a021(6), 1112\u20131129 (1992)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(91)90020-3","volume":"86","author":"M. Chrobak","year":"1991","unstructured":"Chrobak, M., Eppstein, D.: Planar Orientations with Low Out-Degree and Compaction of Adjacency Matrices. Theoretical Computer Science\u00a086(2), 243\u2013266 (1991)","journal-title":"Theoretical Computer Science"},{"key":"19_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiseron, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge (2001)"},{"key":"19_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":"Duffin, R.J.: Topology of Series-Parallel Networks. Journal of Mathematical Analysis and Applications\u00a010, 303\u2013318 (1965)","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0304-3975(96)00035-7","volume":"162","author":"L. Finta","year":"1996","unstructured":"Finta, L., Liu, Z., Milis, I., Bampis, E.: Scheduling UET-UCT Series-Parallel Graphs on Two Processors. Theoretical Computer Science\u00a0162(2), 323\u2013340 (1996)","journal-title":"Theoretical Computer Science"},{"key":"19_CR7","first-page":"519","volume-title":"Boolean Functions: Theory, Algorithms and Applications","author":"M.C. Golumbic","year":"2011","unstructured":"Golumbic, M.C., Gurvich, V.: Read-Once Functions. In: Crama, Y., Hammer, P.L. (eds.) Boolean Functions: Theory, Algorithms and Applications, pp. 519\u2013560. Cambridge University Press, New York (2011)"},{"issue":"10","key":"19_CR8","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1016\/j.dam.2005.09.016","volume":"154","author":"M.C. Golumbic","year":"2006","unstructured":"Golumbic, M.C., Mintz, A., Rotics, U.: Factoring and Recognition of Read-Once Functions Using Cographs and Normality and the Readability of Functions Associated with Partial k-Trees. Discrete Applied Mathematics\u00a0154(10), 1465\u20131477 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0012-365X(79)90131-6","volume":"28","author":"M.C. Golumbic","year":"1979","unstructured":"Golumbic, M.C., Perl, Y.: Generalized Fibonacci Maximum Path Graphs. Discrete Mathematics\u00a028, 237\u2013245 (1979)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"19_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01294263","volume":"11","author":"S. Irani","year":"1994","unstructured":"Irani, S.: Coloring Inductive Graphs On-Line. Algorithmica\u00a011(1), 53\u201372 (1994)","journal-title":"Algorithmica"},{"key":"19_CR11","unstructured":"Korenblit, M.: Efficient Computations on Networks, Ph.D. Thesis, Bar-Ilan University, Israel (2004)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/3-540-45066-1_17","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"M. Korenblit","year":"2003","unstructured":"Korenblit, M., Levit, V.E.: On Algebraic Expressions of Series-Parallel and Fibonacci Graphs. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol.\u00a02731, pp. 215\u2013224. Springer, Heidelberg (2003)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-38756-2_12","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"M. Korenblit","year":"2013","unstructured":"Korenblit, M., Levit, V.E.: A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids. In: Fellows, M., Tan, X., Zhu, B. (eds.) FAW-AAIM 2013. LNCS, vol.\u00a07924, pp. 94\u2013105. Springer, Heidelberg (2013)"},{"key":"19_CR14","first-page":"113","volume-title":"Intelligent Scheduling of Robots and Flexible Manufacturing Systems","author":"V.E. Levit","year":"1996","unstructured":"Levit, V.E., Korenblit, M.: A Symbolic Approach to Scheduling of Robotic Lines. In: Intelligent Scheduling of Robots and Flexible Manufacturing Systems, pp. 113\u2013125. The Center for Technological Education Holon, Israel (1996)"},{"issue":"1-3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.dam.2005.02.007","volume":"149","author":"A. Mintz","year":"2005","unstructured":"Mintz, A., Golumbic, M.C.: Factoring Boolean Functions Using Graph Partitioning. Discrete Applied Mathematics\u00a0149(1-3), 131\u2013153 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(89)90150-3","volume":"66","author":"D. Mundici","year":"1989","unstructured":"Mundici, D.: Functions Computed by Monotone Boolean Formulas with no Repeated Variables. Theoretical Computer Science\u00a066, 113\u2013114 (1989)","journal-title":"Theoretical Computer Science"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0196-8858(91)90030-M","volume":"12","author":"D. Mundici","year":"1991","unstructured":"Mundici, D.: Solution of Rota\u2019s Problem on the Order of Series-Parallel Networks. Advances in Applied Mathematics\u00a012, 455\u2013463 (1991)","journal-title":"Advances in Applied Mathematics"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1016\/S0196-8858(03)00088-5","volume":"32","author":"M. Noy","year":"2004","unstructured":"Noy, M., Rib\u00f3, A.: Recursively Constructible Families of Graphs. Advances in Applied Mathematics\u00a032, 350\u2013363 (2004)","journal-title":"Advances in Applied Mathematics"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-03848-8_7","volume-title":"Business Process Management","author":"M.K. Oikawa","year":"2009","unstructured":"Oikawa, M.K., Ferreira, J.E., Malkowski, S., Pu, C.: Towards Algorithmic Generation of Business Processes: From Business Step Dependencies to Process Algebra Expressions. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol.\u00a05701, pp. 80\u201396. Springer, Heidelberg (2009)"},{"volume-title":"Handbook of Discrete and Combinatorial Mathematics","year":"2000","key":"19_CR20","unstructured":"Rosen, K.H. (ed.): Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton (2000)"},{"issue":"4","key":"19_CR21","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1137\/0214057","volume":"14","author":"A. Satyanarayana","year":"1985","unstructured":"Satyanarayana, A., Wood, R.K.: A Linear Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks. SIAM Journal of Computing\u00a014(4), 818\u2013832 (1985)","journal-title":"SIAM Journal of Computing"},{"key":"19_CR22","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":"Savicky, P., Woods, A.R.: The Number of Boolean Functions Computed by Formulas of a Given Size. Random Structures and Algorithms\u00a013, 349\u2013382 (1998)","journal-title":"Random Structures and Algorithms"},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01581240","volume":"59","author":"A. Tamir","year":"1993","unstructured":"Tamir, A.: A Strongly Polynomial Algorithm for Minimum Convex Separable Quadratic Cost Flow Problems on Two-Terminal Series-Parallel Networks. Mathematical Programming\u00a059, 117\u2013132 (1993)","journal-title":"Mathematical Programming"},{"key":"19_CR24","unstructured":"Wang, A.R.R.: Algorithms for Multilevel Logic Optimization, Ph.D. Thesis, University of California, Berkeley (1989)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:58:50Z","timestamp":1559091530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}