TY - GEN
T1 - On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs
AU - Korenblit, Mark
AU - Levit, Vadim E.
N1 - Publisher Copyright:
© 2020, Springer Nature Switzerland AG.
PY - 2020
Y1 - 2020
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85079543684&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-39219-2_21
DO - 10.1007/978-3-030-39219-2_21
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85079543684
SN - 9783030392185
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 248
EP - 259
BT - Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Proceedings
A2 - Changat, Manoj
A2 - Das, Sandip
T2 - 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020
Y2 - 13 February 2020 through 15 February 2020
ER -