505 search results - page 36 / 101 » On A Graph Formalism for Ordered Edges |
156
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Graph logic (GL) is a spatial logic for querying graphs introduced by Cardelli et al. It has been observed that in terms of expressive power, this logic is a fragment of ...
148
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
197
Voted
SOFSEM
2007
Springer
16 years 25 days ago
2007
Springer
Digital technology is increasingly deployed in safety-critical situations. This calls for systematic design and verification methodologies that can cope with three major sources o...
177
click to vote
JCT
2007
15 years 6 months ago
2007
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...
148
click to vote
ENTCS
2002
15 years 6 months ago
2002
ended abstract demonstrates that creating editors and environments for visual languages becomes considerably easier when restricting the class of visual languages. The presented a...