Functions comuted by monotone boolean formulas with no repeated variables
Theoretical Computer Science
Introduction to algorithms
Solution of Rota's problem on the order of series 驴 Parallel networks
Advances in Applied Mathematics
Algorithms for multilevel logic optimization
Algorithms for multilevel logic optimization
Optimal reduction of two-terminal directed acyclic graphs
SIAM Journal on Computing
The number of Boolean functions computed by formulas of a given size
proceedings of the eighth international conference on Random structures and algorithms
Factoring logic functions using graph partitioning
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Simple image set of (max, +) linear mappings
Discrete Applied Mathematics
Factoring and recognition of read-once functions using cographs and normality
Proceedings of the 38th annual Design Automation Conference
Measuring the Distance to Series-Parallelity by Path Expressions
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
On-Line Algorithms for Shortest Path Problems on Planar Digraphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
A new algorithm for the recognition of series parallel graphs
A new algorithm for the recognition of series parallel graphs
Algorithms for learning regular expressions from positive data
Information and Computation
A Note on the Recognition of Nested Graphs
Graph Theory, Computational Intelligence and Thought
BPM '09 Proceedings of the 7th International Conference on Business Process Management
| Hi-index | 0.00 |
The paper investigates relationship between algebraic expressions and graphs. Through out the paper we consider two kinds of digraphs: series-parallel graphs and Fibonacci graphs (which give a generic example of non-series-parallel graphs). Motivated by the fact that the most compact expressions of series-parallel graphs are read-once formulae, and, thus, of O(n) length, we propose an algorithm generating expressions of O(n2) length for Fibonacci graphs. A serious effort was made to prove that this algorithm yields expressions with a minimum number of terms. Using an interpretation of a shortest path algorithm as an algebraic expression, a symbolic approach to the shortest path problem is proposed.