523 search results - page 28 / 105 » Decidability of string graphs |
KR
2004
Springer
15 years 2 months ago
2004
Springer
Simple Conceptual Graphs (SGs) are used to represent entities and relations between these entities: they can be translated into positive, conjunctive, existential first-order log...
74
Voted
DM
2010
14 years 9 months ago
2010
A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimu...
IPL
2002
14 years 9 months ago
2002
Inspired by recent algorithms for electing a leader in a distributed system, we study the following game in a directed graph: each vertex selects one of its outgoing arcs (if any)...
85
Voted
JSYML
2010
14 years 4 months ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
78
Voted
SOFSEM
2010
Springer
15 years 6 months ago
2010
Springer
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...