1952 search results - page 99 / 391 » Complete partitions of graphs |
135
click to vote
VL
2007
IEEE
15 years 10 months ago
2007
IEEE
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
142
click to vote
ORL
2008
15 years 4 months ago
2008
Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph...
132
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper presents a learning theoretical analysis of correlation clustering (Bansal et al., 2002). In particular, we give bounds on the error with which correlation clustering r...
159
click to vote
COMGEO
2007
ACM
15 years 4 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
142
click to vote
SC
2005
ACM
15 years 9 months ago
2005
ACM
Many emerging large-scale data science applications require searching large graphs distributed across multiple memories and processors. This paper presents a distributed breadth...