1105 search results - page 110 / 221 » Linear choosability of graphs |
121
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
151
click to vote
SIGARCH
2008
15 years 4 months ago
2008
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
151
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
119
click to vote
SIAMCOMP
2000
15 years 4 months ago
2000
We consider a system of uniform recurrence equations (URE) of dimension one. We show how its computation can be carried out using minimal memory size with several synchronous proc...
172
click to vote
ISAAC
2010
Springer
15 years 2 months ago
2010
Springer
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...