{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:52:52Z","timestamp":1725583972097},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387555"},{"type":"electronic","value":"9783642387562"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38756-2_12","type":"book-chapter","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T00:43:48Z","timestamp":1369097028000},"page":"94-105","source":"Crossref","is-referenced-by-count":1,"title":["A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids"],"prefix":"10.1007","author":[{"given":"Mark","family":"Korenblit","sequence":"first","affiliation":[]},{"given":"Vadim E.","family":"Levit","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5439","key":"12_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":"12_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":"12_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":"12_CR4","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"},{"key":"12_CR5","unstructured":"Golumbic, M.C., Mintz, A.: Factoring Logic Functions Using Graph Partitioning. In: Proc. IEEE\/ACM Int. Conf. Computer Aided Design, pp. 109\u2013114 (1999)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C., Mintz, A., Rotics, U.: Factoring and Recognition of Read-Once Functions using Cographs and Normality. In: Proc. 38th Design Automation Conf., pp. 195\u2013198 (2001)","DOI":"10.1145\/378239.378356"},{"key":"12_CR7","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":"12_CR8","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"},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1137\/S0097539793255709","volume":"25","author":"L.M. Kirousis","year":"1996","unstructured":"Kirousis, L.M., Thilikos, D.M.: The Linkage of a Graph. SIAM Journal on Computing\u00a025(3), 626\u2013647 (1996)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR10","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":"12_CR11","unstructured":"Korenblit, M., Levit, V.E.: Square Rhomboids and Their Algebraic Expressions. In: Proc. 2009 Int. Conf. on Theoretical and Mathematical Foundations of Computer Science (TMFCS 2009) , pp. 110\u2013117 (2009)"},{"key":"12_CR12","unstructured":"Korenblit, M., Levit, V.E.: An Improved Full Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids. In: Proc. 2010 Int. Conf. on Theoretical and Mathematical Foundations of Computer Science (TMFCS-10), pp. 31\u201338 (2010)"},{"key":"12_CR13","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":"12_CR14","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":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/3-540-59071-4_54","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"V. Naumann","year":"1995","unstructured":"Naumann, V.: Measuring the Distance to Series-Parallelity by Path Expressions. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol.\u00a0903, pp. 269\u2013281. Springer, Heidelberg (1995)"},{"volume-title":"Handbook of Discrete and Combinatorial Mathematics","year":"2000","key":"12_CR16","unstructured":"Rosen, K.H. (ed.): Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton (2000)"},{"key":"12_CR17","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":"12_CR18","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","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38756-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T03:16:31Z","timestamp":1557717391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38756-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387555","9783642387562"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38756-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}