[HTML][HTML] Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
M Korenblit - Discrete Applied Mathematics, 2017 - Elsevier
The paper investigates relationship between algebraic expressions and two-terminal
directed acyclic graphs. We consider rhomboidal non-series–parallel graphs, specifically, a …
directed acyclic graphs. We consider rhomboidal non-series–parallel graphs, specifically, a …
A Note on Algebraic Expressions of Rhomboidal Labeled Graphs
M Korenblit - Electronic Notes in Discrete Mathematics, 2015 - Elsevier
This paper investigates relationship between algebraic expressions and labeled graphs. We
consider rhomboidal non-series-parallel graphs, specifically, a new digraph called a full …
consider rhomboidal non-series-parallel graphs, specifically, a new digraph called a full …
On Algebraic Expressions of Directed Grid Graphs
M Korenblit - Electronic Notes in Discrete Mathematics, 2017 - Elsevier
The paper investigates relationship between algebraic expressions and labeled graphs. We
consider directed grid graphs having m rows and n columns. Our intent is to simplify the …
consider directed grid graphs having m rows and n columns. Our intent is to simplify the …
Algebraic Expressions of Rhomboidal Graphs
M Korenblit - Conference on Algorithms and Discrete Applied …, 2015 - Springer
The paper investigates relationship between algebraic expressions and graphs. We
consider rhomboidal non-series-parallel graphs, specifically, a digraph called a full square …
consider rhomboidal non-series-parallel graphs, specifically, a digraph called a full square …
[PDF][PDF] On the Minimum Number of Plus Operators in Expressions of Series-Parallel Graphs and in Read-Once Functions
M Korenblit, VE Levit - 2014 - nms.kcl.ac.uk
We consider a labeled two-terminal directed acyclic graph in which each edge has a unique
label. Each path between the source and the sink (a spanning path) in a graph can be …
label. Each path between the source and the sink (a spanning path) in a graph can be …