1963 search results - page 208 / 393 » The Maximum Solution Problem on Graphs |
116
click to vote
PPOPP
2005
ACM
15 years 6 months ago
2005
ACM
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
115
click to vote
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
JACM
2007
15 years 26 days ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
ADBIS
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
114
click to vote
SIGECOM
2009
ACM
15 years 7 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...