751 search results - page 45 / 151 » The Distinguishing Chromatic Number |
OTM
2009
Springer
15 years 3 months ago
2009
Springer
We present ontology databases with not-gadgets, a method for detecting inconsistencies in an ontology with large numbers of annotated instances by using triggers and exclusion depe...
DM
2007
14 years 11 months ago
2007
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
COMPGEOM
1991
ACM
15 years 2 months ago
1991
ACM
Given a simple polygon in the plane with two distinguished vertices, s and g, is it possible for two guards to simultaneously walk along the two boundary chains from s to g in suc...
FOCS
2008
IEEE
15 years 5 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
APPROX
2004
Springer
15 years 4 months ago
2004
Springer
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is 1−2−k +o(1) as m/...