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 upper bound of a length of the shortest expression for every st-dag of order n.
|Title of host publication||Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Proceedings|
|Editors||Manoj Changat, Sandip Das|
|Number of pages||12|
|State||Published - 2020|
|Event||6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020 - Hyderabad, India|
Duration: 13 Feb 2020 → 15 Feb 2020
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020|
|Period||13/02/20 → 15/02/20|
Bibliographical notePublisher Copyright:
© 2020, Springer Nature Switzerland AG.