5981 search results - page 250 / 1197 » time 2006 |
182
click to vote
PAAPP
1998
15 years 6 months ago
1998
We present optimal parallel algorithms that run in O( pn) time on a pn pn meshconnected computer for a number of fundamental problems concerning proximity and visibility in a simp...
143
click to vote
QUESTA
1998
15 years 6 months ago
1998
We consider optimal policies for reentrant queues in which customers may be served several times at the same station. We show that for tandem reentrant queues the lastbuffer-fir...
127
click to vote
NETWORKS
2007
15 years 6 months ago
2007
The maximum residual flow problem with one-arc destruction is shown to be solvable in strongly polynomial time in [Aneja et al., Networks, 38 (2001), 194-198.]. However the statu...
175
click to vote
JCT
2010
15 years 5 months ago
2010
We prove that every graph with maximum degree ∆ can be properly (∆ + 1)coloured so that no colour appears more than O(log ∆/ log log ∆) times in the neighbourhood of any v...
174
click to vote
FCS
2006
15 years 8 months ago
2006
The problem of finding a negative cycle in a weighted, directed graph is discussed here. First the algorithm for printing out a negative cycle reachable from the source s, with th...