Skip to main content
Springer Nature Link
Log in

Algebraic Expressions of Rhomboidal Graphs

  • Conference paper
Algorithms and Discrete Applied Mathematics (CALDAM 2015)

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

Included in the following conference series:

  • 1277 Accesses

Abstract

The paper investigates relationship between algebraic expressions and graphs. We consider rhomboidal non-series-parallel graphs, specifically, a digraph called a full square rhomboid. Our intention is to simplify the expressions of full square rhomboids. We describe two decomposition methods for generating expressions of rhomboidal graphs and carry out their comparative analysis.

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  MATH  MathSciNet  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  MATH  MathSciNet  Google Scholar 

  4. Cormen, T.H., Leiseron, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge (2001)

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Finta, L., Liu, Z., Milis, I., Bampis, E.: Scheduling UET-UCT Series-Parallel Graphs on Two Processors. Theoretical Computer Science 162(2), 323–340 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  7. Golumbic, M.C., Gurvich, V.: Read-Once Functions. In: Crama, Y., Hammer, P.L. (eds.) Boolean Functions: Theory, Algorithms and Applications, pp. 519–560. Cambridge University Press, New York (2011)

    Google Scholar 

  8. 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 154(10), 1465–1477 (2006)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Korenblit, M.: Efficient Computations on Networks, Ph.D. Thesis, Bar-Ilan University, Israel (2004)

    Google Scholar 

  12. 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 

  13. 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. 7924, pp. 94–105. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  14. Levit, V.E., Korenblit, M.: A Symbolic Approach to Scheduling of Robotic Lines. In: Intelligent Scheduling of Robots and Flexible Manufacturing Systems, pp. 113–125. The Center for Technological Education Holon, Israel (1996)

    Google Scholar 

  15. Mintz, A., Golumbic, M.C.: Factoring Boolean Functions Using Graph Partitioning. Discrete Applied Mathematics 149(1-3), 131–153 (2005)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  18. Noy, M., Ribó, A.: Recursively Constructible Families of Graphs. Advances in Applied Mathematics 32, 350–363 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  19. 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. 5701, pp. 80–96. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

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

    MATH  Google Scholar 

  21. Satyanarayana, A., Wood, R.K.: A Linear Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks. SIAM Journal of Computing 14(4), 818–832 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  22. 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  MATH  MathSciNet  Google Scholar 

  23. Tamir, A.: A Strongly Polynomial Algorithm for Minimum Convex Separable Quadratic Cost Flow Problems on Two-Terminal Series-Parallel Networks. Mathematical Programming 59, 117–132 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  24. 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

Authors
  1. Mark Korenblit
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, I.I.T. Kanpur, 208016, India

    Sumit Ganguly

  2. School of Computing Science, Simon Fraser University, V5A 1S6, Burnaby, BC, Canada

    Ramesh Krishnamurti

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Korenblit, M. (2015). Algebraic Expressions of Rhomboidal Graphs. In: Ganguly, S., Krishnamurti, R. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2015. Lecture Notes in Computer Science, vol 8959. Springer, Cham. https://doi.org/10.1007/978-3-319-14974-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-14974-5_19

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-14973-8

  • Online ISBN: 978-3-319-14974-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics