@inbook{1b93da10535f4eeb9cab6c15eb298314,

title = "On algebraic expressions of series-parallel and Fibonacci graphs",

abstract = "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.",

author = "Mark Korenblit and Levit, {Vadim E.}",

year = "2003",

doi = "10.1007/3-540-45066-1_17",

language = "אנגלית",

isbn = "3540405054",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "215--224",

editor = "Calude, {Cristian S.} and Dinneen, {Michael J.} and Vincent Vajnovszki",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}