TY - GEN

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

AU - Korenblit, Mark

AU - Levit, Vadim E.

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84878122581&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84878122581

SN - 9781617820717

T3 - International Conference on Theoretical and Mathematical Foundations of Computer Science 2010, TMFCS 2010

SP - 31

EP - 38

BT - International Conference on Theoretical and Mathematical Foundations of Computer Science 2010, TMFCS 2010

T2 - 2010 International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS 2010

Y2 - 12 July 2010 through 14 July 2010

ER -