3 search results - page 1 / 1 » Helly-type theorems for approximate covering |
COMPGEOM
2008
ACM
13 years 6 months ago
2008
ACM
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
CSL
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ï...