4171 search results - page 430 / 835 » Choice numbers of graphs |
208
click to vote
DCC
2005
IEEE
16 years 6 months ago
2005
IEEE
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
157
click to vote
SSDBM
1990
IEEE
15 years 11 months ago
1990
IEEE
In this paper we explore the structure and semantic properties of the entities stored in statistical databases. We call such entities "statistical objects" (SOS) and prop...
142
click to vote
FMCAD
2000
Springer
15 years 10 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
196
click to vote
AAAI
2008
15 years 9 months ago
2008
This paper investigates the impact of symbolic search for solving domain-independent action planning problems with binary decision diagrams (BDDs). Polynomial upper and exponential...
185
click to vote
ACL
2008
15 years 8 months ago
2008
Underspecification-based algorithms for processing partially disambiguated discourse structure must cope with extremely high numbers of readings. Based on previous work on dominan...