Skip to main content
Springer Nature Link
Log in

A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids

  • Conference paper
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7924))

  • 956 Accesses

Abstract

The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a square rhomboid that is an example of non-series-parallel graphs. Our intention is to simplify the expressions of square rhomboids and eventually find their shortest representations. With that end in view, we describe the new algorithm for generating square rhomboid expressions based on the decomposition method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Barabási, A.-L., Albert, R.: Emergence of Scaling in Random Networks. Science 286(5439), 509–512 (1999)

    Article  MathSciNet  Google Scholar 

  2. Bein, W.W., Kamburowski, J., Stallmann, M.F.M.: Optimal Reduction of Two-Terminal Directed Acyclic Graphs. SIAM Journal of Computing 21(6), 1112–1129 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Chrobak, M., Eppstein, D.: Planar Orientations with Low Out-Degree and Compaction of Adjacency Matrices. Theoretical Computer Science 86(2), 243–266 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  4. Duffin, R.J.: Topology of Series-Parallel Networks. Journal of Mathematical Analysis and Applications 10, 303–318 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  5. Golumbic, M.C., Mintz, A.: Factoring Logic Functions Using Graph Partitioning. In: Proc. IEEE/ACM Int. Conf. Computer Aided Design, pp. 109–114 (1999)

    Google Scholar 

  6. 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–198 (2001)

    Google Scholar 

  7. Golumbic, M.C., Perl, Y.: Generalized Fibonacci Maximum Path Graphs. Discrete Mathematics 28, 237–245 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  8. Irani, S.: Coloring Inductive Graphs On-Line. Algorithmica 11(1), 53–72 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kirousis, L.M., Thilikos, D.M.: The Linkage of a Graph. SIAM Journal on Computing 25(3), 626–647 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  10. 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. 2731, pp. 215–224. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. 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–117 (2009)

    Google Scholar 

  12. 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–38 (2010)

    Google Scholar 

  13. Mundici, D.: Functions Computed by Monotone Boolean Formulas with no Repeated Variables. Theoretical Computer Science 66, 113–114 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  14. Mundici, D.: Solution of Rota’s Problem on the Order of Series-Parallel Networks. Advances in Applied Mathematics 12, 455–463 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  15. Naumann, V.: Measuring the Distance to Series-Parallelity by Path Expressions. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903, pp. 269–281. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  16. Rosen, K.H. (ed.): Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton (2000)

    MATH  Google Scholar 

  17. Savicky, P., Woods, A.R.: The Number of Boolean Functions Computed by Formulas of a Given Size. Random Structures and Algorithms 13, 349–382 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  18. Wang, A.R.R.: Algorithms for Multilevel Logic Optimization, Ph.D. Thesis, University of California, Berkeley (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Holon Institute of Technology, Israel

    Mark Korenblit

  2. Ariel University, Israel

    Vadim E. Levit

Authors
  1. Mark Korenblit
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vadim E. Levit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Engineering and Information Technology, Charles Darwin University, 0909, Darwin, NT, Australia

    Michael Fellows

  2. School of High-Technology for Human Welfare, Tokai University, 317 Nishimo, 410-0395, Numazu, Japan

    Xuehou Tan

  3. Department of Computer Science, Montana State University, 59717, Bozeman, MT, USA

    Binhai Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korenblit, M., Levit, V.E. (2013). A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids. In: Fellows, M., Tan, X., Zhu, B. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7924. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38756-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38756-2_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38755-5

  • Online ISBN: 978-3-642-38756-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics