On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs

Mark Korenblit; Vadim E. Levit

doi:10.1007/978-3-030-39219-2_21

On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs

Mark Korenblit, Vadim E. Levit

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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 upper bound of a length of the shortest expression for every st-dag of order n.

Original language	English
Title of host publication	Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Proceedings
Editors	Manoj Changat, Sandip Das
Publisher	Springer
Pages	248-259
Number of pages	12
ISBN (Print)	9783030392185
DOIs	https://doi.org/10.1007/978-3-030-39219-2_21
State	Published - 2020
Externally published	Yes
Event	6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020 - Hyderabad, India Duration: 13 Feb 2020 → 15 Feb 2020

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12016 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020
Country/Territory	India
City	Hyderabad
Period	13/02/20 → 15/02/20

Bibliographical note

Publisher Copyright:
© 2020, Springer Nature Switzerland AG.

Access to Document

10.1007/978-3-030-39219-2_21

Cite this

Korenblit, M., & Levit, V. E. (2020). On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. In M. Changat, & S. Das (Eds.), Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Proceedings (pp. 248-259). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12016 LNCS). Springer. https://doi.org/10.1007/978-3-030-39219-2_21

Korenblit, Mark ; Levit, Vadim E. / On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Proceedings. editor / Manoj Changat ; Sandip Das. Springer, 2020. pp. 248-259 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{9833f83b71f3485f9bd0b74995a56d1b,

title = "On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs",

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 upper bound of a length of the shortest expression for every st-dag of order n.",

author = "Mark Korenblit and Levit, {Vadim E.}",

note = "Publisher Copyright: {\textcopyright} 2020, Springer Nature Switzerland AG.; 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020 ; Conference date: 13-02-2020 Through 15-02-2020",

year = "2020",

doi = "10.1007/978-3-030-39219-2_21",

language = "אנגלית",

isbn = "9783030392185",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer",

pages = "248--259",

editor = "Manoj Changat and Sandip Das",

booktitle = "Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Proceedings",

}

Korenblit, M & Levit, VE 2020, On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. in M Changat & S Das (eds), Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 12016 LNCS, Springer, pp. 248-259, 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020, Hyderabad, India, 13/02/20. https://doi.org/10.1007/978-3-030-39219-2_21

On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. / Korenblit, Mark; Levit, Vadim E.
Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Proceedings. ed. / Manoj Changat; Sandip Das. Springer, 2020. p. 248-259 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12016 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs

AU - Korenblit, Mark

AU - Levit, Vadim E.

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

PB - Springer

T2 - 6th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2020

Y2 - 13 February 2020 through 15 February 2020

ER -

Korenblit M, Levit VE. On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs. In Changat M, Das S, editors, Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Proceedings. Springer. 2020. p. 248-259. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-39219-2_21

On Algebraic Expressions of Two-Terminal Directed Acyclic Graphs

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this