906 search results - page 66 / 182 » Chain Dominated Orders |
UAI
1996
15 years 1 months ago
1996
We derive qualitative relationships about the informationalrelevance of variables in graphical decision models based on a consideration of the topology of the models. Speci cally,...
ARSCOM
2004
14 years 11 months ago
2004
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
100
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
TASE
2008
IEEE
14 years 11 months ago
2008
IEEE
This paper addresses the general single-machine earliness-tardiness problem with distinct release dates, due dates, and unit costs. The aim of this research is to obtain an exact n...
LACL
2005
Springer
15 years 5 months ago
2005
Springer
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...