779 search results - page 53 / 156 » A graph polynomial for independent sets of bipartite graphs |
AI
2007
Springer
14 years 10 months ago
2007
Springer
One difficulty that arises in abstract argument systems is that many natural questions regarding argument acceptability are, in general, computationally intractable having been c...
124
click to vote
ICDCS
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we study the problem of minimum connected dominating set in geometric k-disk graphs. This research is motivated by the problem of virtual backbone construction in w...
118
click to vote
COCOON
2009
Springer
15 years 4 months ago
2009
Springer
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
177
click to vote
CP
2009
Springer
15 years 10 months ago
2009
Springer
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
102
click to vote
ESA
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path len...