An improved full decomposition algorithm for generating algebraic expressions of square rhomboids

Mark Korenblit, Vadim E. Levit

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a square rhomboid that is an example of non-series-parallel graphs. Our intention is to simplify the expressions of square rhomboids and eventually find their shortest representations. With that end in view, we describe the new algorithm for generating square rhomboid expressions which gives more compact expression in comparison with algorithms published earlier.

Original languageEnglish
Title of host publicationInternational Conference on Theoretical and Mathematical Foundations of Computer Science 2010, TMFCS 2010
Pages31-38
Number of pages8
StatePublished - 2010
Event2010 International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS 2010 - Orlando, FL, United States
Duration: 12 Jul 201014 Jul 2010

Publication series

NameInternational Conference on Theoretical and Mathematical Foundations of Computer Science 2010, TMFCS 2010

Conference

Conference2010 International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS 2010
Country/TerritoryUnited States
CityOrlando, FL
Period12/07/1014/07/10

Fingerprint

Dive into the research topics of 'An improved full decomposition algorithm for generating algebraic expressions of square rhomboids'. Together they form a unique fingerprint.

Cite this