4171 search results - page 218 / 835 » Choice numbers of graphs |
164
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
156
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
The emergence of social conventions in multi-agent systems has been analyzed mainly in settings where every agent may interact either with every other agent or with nearest neighb...
166
click to vote
TOMS
2010
15 years 5 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
205
click to vote
SIGMOD
2001
ACM
16 years 6 months ago
2001
ACM
Materialized views have been found to be very effective at speeding up queries, and are increasingly being supported by commercial databases and data warehouse systems. However, w...
177
click to vote
ALT
2008
Springer
16 years 3 months ago
2008
Springer
It is investigated for which choice of a parameter q, denoting the number of contexts, the class of simple external contextual languages is iteratively learnable. On one hand, the ...