10 search results - page 1 / 2 » Graph Operations Characterizing Rank-Width and Balanced Grap... |
WG
2007
Springer
14 years 5 months ago
2007
Springer
TAGT
1994
Springer
14 years 3 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
ASP
2003
Springer
14 years 4 months ago
2003
Springer
We investigate rule dependency graphs and their colorings for characterizing the computation of answer sets of logic programs. To this end, we develop a series of operational chara...
IFL
1997
Springer
14 years 3 months ago
1997
Springer
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
FSTTCS
2009
Springer
14 years 5 months ago
2009
Springer
The paper focuses on the structure of fundamental sequences of ordinals smaller than ε0. A first result is the construction of a monadic second-order formula identifying a given ...