On algebraic expressions of series-parallel and Fibonacci graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2731, Issue , 2003, Pages 215-224

  Korenblit, Mark ^a   Levit, Vadim E ^a  

^a HOLON INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; GRAPHIC METHODS;

ALGEBRAIC EXPRESSION; SERIES-PARALLEL; SERIES-PARALLEL GRAPH; SHORTEST PATH;

GRAPH THEORY;

EID: 35248861186     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45066-1_17     Document Type: Article

References (17)

1. W.W. Bein, J. Kamburowski, and M.F.M. Stallmann, Optimal Reduction of Two-Terminal Directed Acyclic Graphs, SIAM Journal of Computing, Vol. 21, No 6, 1992, 1112-1129.
2. P. Butkovic, Simple Image Set of (max, +) Linear Mappings, Discrete Applied Mathematics 105, 2000, 237-246.
3. Th.H. Cormen, Ch.E. Leiseron, and R.L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge, Massachusetts, 1994.
4. Hr.N. Djidjev, Efficient Algorithms for Shortest Path Queries in Planar Digraphs, in: Graph-Theoretic Concepts in Computer Science, Proc. 22nd Int. Workshop, WG '96, LNCS 1197, Springer, 1996, 151-165.
5. R.J. Duffin, Topology of Series-Parallel Networks, Journal of Mathematical Analysis and Applications 10, 1965, 303-318.
6. M.Ch. Golumbic and A. Mintz, Factoring Logic Functions Using Graph Partitioning, in: Proc. IEEE/ACM Int. Conf. Computer Aided Design, November 1999, 109-114.
7. M.Ch. Golumbic, A. Mintz, and U. Rotics, Factoring and Recognition of Read-Once Functions using Cographs and Normality, in: Proc. 38th Design Automation Conf., June 2001, 195-198.
8. M.Ch. Golumbic and Y. Perl, Generalized Fibonacci Maximum Path Graphs, Discrete Mathematics 28, 1979, 237-245.
9. V.E. Levit and M. Korenblit, Symbolic PERT and its Generalization, in: Intelligent Scheduling of Robots and Flexible Manufacturing Systems, Proc. Int. Workshop held at the Center for Technological Education Holon, Israel, July 1995, 65-80.
10. V.E. Levit and M. Korenblit, A Symbolic Approach to Scheduling of Robotic Lines, in: Intelligent Scheduling of Robots and Flexible Manufacturing Systems, The Center for Technological Education Holon, Israel, 1996, 113-125.
11. D. Mundici, Functions Computed by Monotone Boolean Formulas with no Repeated Variables, Theoretical Computer Science 66, 1989, 113-114.
12. D. Mundici, Solution of Rota's Problem on the Order of Series-Parallel Networks, Advances in Applied Mathematics 12, 1991, 455-463.
13. V. Naumann, Measuring the Distance to Series-Parallelity by Path Expressions, in: Graph-Theoretic Concepts in Computer Science, Proc. 20th Int. Workshop, WG '94, LNCS 903, Springer, 1994, 269-281.
14. P. Savicky and A.R. Woods, The Number of Boolean Functions Computed by Formulas of a Given Size, Random Structures and Algorithms 13, 1998, 349-382.
15. B. Schoenmakers, A New Algorithm for the Recognition of Series Parallel Graphs, Report CS-R9504, ISSN 0169-118X, CWI, Amsterdam, The Netherlands, 1995.
16. J. Valdes, R.E. Tarjan, and E.L. Lawler, The Recognition of Series Parallel Digraphs, SIAM Journal of Computing, Vol. 11, No 2, 1982, 298-313.
17. A.R.R. Wang, Algorithms for Multilevel Logic Optimization, Ph.D. Thesis, University of California, Berkeley, 1989.