Skip to main content
Springer Nature Link
Log in

On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs

  • Conference paper
  • First Online:
Algorithms and Discrete Applied Mathematics (CALDAM 2020)

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

Included in the following conference series:

Abstract

The paper investigates relationship between algebraic expressions and graphs. Our intent is to simplify graph expressions and eventually find their shortest representations. We describe the decomposition method for generating expressions of complete st-dags (two-terminal directed acyclic graphs) and estimate the corresponding expression complexities. Using these findings, we present an \(2^{O\left( \log ^{2}n\right) }\) upper bound of a length of the shortest expression for every st-dag of order n.

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

Similar content being viewed by others

References

  1. Anderson, D.F., Levy, R., Shapiro, J.: Zero-divisor graphs, von Neumann regular rings, and Boolean algebras. J. Pure Appl. Algebra 180, 221–241 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bein, W.W., Kamburowski, J., Stallmann, M.F.M.: Optimal reduction of two-terminal directed acyclic graphs. SIAM J. Comput. 21(6), 1112–1129 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10, 303–318 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fernau, H.: Algorithms for learning regular expressions from positive data. Inf. Comput. 207, 521–541 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fernau, H., Ryan, J.F., Sugeng, K.A.: A sum labelling for the generalised friendship graph. Discrete Math. 308, 734–740 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Finta, L., Liu, Z., Milis, I., Bampis, E.: Scheduling UET-UCT series-parallel graphs on two processors. Theoret. Comput. Sci. 162(2), 323–340 (1996)

    Article  MathSciNet  MATH  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 Appl. Math. 154(10), 1465–1477 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  9. Golumbic, M.C., Perl, Y.: Generalized Fibonacci maximum path graphs. Discrete Math. 28, 237–245 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  10. Gulan, S.: Series parallel digraphs with loops. Graphs encoded by regular expression. Theory Comput. Syst. 53, 126–158 (2013)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  12. Korenblit, M.: Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs. Discrete Appl. Math. 228, 60–72 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  13. 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). https://doi.org/10.1007/3-540-45066-1_17

    Chapter  MATH  Google Scholar 

  14. Korenblit, M., Levit, V.E.: Estimation of expressions’ complexities for two-terminal directed acyclic graphs. Electron. Not. Discrete Math. 63, 109–116 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  15. Mintz, A., Golumbic, M.C.: Factoring Boolean functions using graph partitioning. Discrete Appl. Math. 149(1–3), 131–153 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. Mundici, D.: Functions computed by monotone boolean formulas with no repeated variables. Theoret. Comput. Sci. 66, 113–114 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  17. Mundici, D.: Solution of Rota’s problem on the order of series-parallel networks. Adv. Appl. Math. 12, 455–463 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  18. 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). https://doi.org/10.1007/3-540-59071-4_54

    Chapter  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). https://doi.org/10.1007/978-3-642-03848-8_7

    Chapter  Google Scholar 

  20. Satyanarayana, A., Wood, R.K.: A linear time algorithm for computing k-terminal reliability in series-parallel networks. SIAM J. Comput. 14(4), 818–832 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  21. Savicky, P., Woods, A.R.: The number of boolean functions computed by formulas of a given size. Random Struct. Algorithms 13, 349–382 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  22. Tamir, A.: A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks. Math. Program. 59, 117–132 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  23. 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, Holon, Israel

    Mark Korenblit

  2. Ariel University, Ariel, 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

Corresponding author

Correspondence to Mark Korenblit .

Editor information

Editors and Affiliations

  1. University of Kerala, Thiruvananthapuram, India

    Manoj Changat

  2. Indian Statistical Institute, Kolkata, India

    Sandip Das

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Korenblit, M., Levit, V.E. (2020). On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. In: Changat, M., Das, S. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2020. Lecture Notes in Computer Science(), vol 12016. Springer, Cham. https://doi.org/10.1007/978-3-030-39219-2_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-39219-2_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-39218-5

  • Online ISBN: 978-3-030-39219-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics