18429 search results - page 382 / 3686 » Typing dynamic typing |
156
click to vote
ENTCS
2002
15 years 6 months ago
2002
We consider the dual of Theorem 1 from [33], relating closure conditions on subcategories with projectivity classes for collections of discrete cocones. We extend these results by...
176
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
205
click to vote
GC
2002
Springer
15 years 6 months ago
2002
Springer
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
