778 search results - page 21 / 156 » Expressiveness and complexity of graph logic |
89
Voted
JCT
2007
15 years 10 days ago
2007
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
CCCG
2004
15 years 1 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
112
click to vote
SIGDOC
2000
ACM
15 years 4 months ago
2000
ACM
We address two problems of technical authors in structured environments: (1) Structure definitions of the SGML school are limiting: they require one primary hierarchy and do not c...
ATVA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The emerging technology of interacting systems calls for new forto ensure their reliability. Concurrent games are paradigmatic abstract models for which several logics ha...
CORR
2010
Springer
15 years 16 days ago
2010
Springer
Deterministic graph grammars generate regular graphs, that form a structural extension of configuration graphs of pushdown systems. In this paper, we study a probabilistic extensio...