1105 search results - page 171 / 221 » Linear choosability of graphs |
IPPS
1995
IEEE
15 years 3 months ago
1995
IEEE
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
112
click to vote
STOC
1995
ACM
15 years 3 months ago
1995
ACM
We relate the sequence of minimum bases of a matroid with linearly varying weights to three problems from combinatorial geometry: k-sets, lower envelopes of line segments, and con...
129
click to vote
ICCI
1991
15 years 3 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
SODA
2008
ACM
15 years 1 months ago
2008
ACM
It is known that the dynamics of best response in an environment of non-cooperative users may converge to a good solution when users play sequentially, but may cycle far away from...
103
click to vote
UAI
2008
15 years 1 months ago
2008
Assume that cause-effect relationships between variables can be described as a directed acyclic graph and the corresponding linear structural equation model We consider the identi...