2503 search results - page 248 / 501 » A study of 3-arc graphs |
154
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
181
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
Irregular and sparse scientific computing programs frequently experience performance losses due to inefficient use of the memory system in most machines. Previous work has shown t...
192
click to vote
IWPEC
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we initiate a systematic study of the Reduced Degree Spanning Tree problem, where given a digraph D and a nonnegative integer k, the goal is to construct a spanning o...
169
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. The synthesis of a reactive system with respect to an ωregular specification requires the solution of a graph game. Such games have been extended in two natural ways. F...
179
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...