505 search results - page 8 / 101 » On A Graph Formalism for Ordered Edges |
SWAT
1998
Springer
15 years 1 months ago
1998
Springer
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
IFL
1997
Springer
15 years 1 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...
DIMACS
1996
14 years 11 months ago
1996
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
68
Voted
GD
2005
Springer
15 years 3 months ago
2005
Springer
Force-directed placement is a widely used approach to automatically arranging the nodes and edges of a relational diagram or graph in an aesthetically pleasing manner. The adoption...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...