177 search results - page 3 / 36 » Logical complexity of graphs: a survey |
CSL
2008
Springer
13 years 7 months ago
2008
Springer
We study the logical definablity of the winning regions of parity games. For games with a bounded number of priorities, it is wellknown that the winning regions are definable in th...
LPAR
2004
Springer
13 years 11 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
TAMC
2009
Springer
14 years 18 days ago
2009
Springer
STACS
2007
Springer
14 years 5 days ago
2007
Springer
RELMICS
1998
Springer
13 years 10 months ago
1998
Springer
We present a class of polymodal logics for which the set of terms indexing the modal connectives can be hierarchized in two levels: the set of Boolean terms and the set of terms b...