4315 search results - page 104 / 863 » Sorting in linear time |
IPL
2007
13 years 9 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
JLP
2008
13 years 9 months ago
2008
A formulation of na
MST
1998
13 years 8 months ago
1998
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a mac...
SIAMCOMP
2011
12 years 11 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
MA
2010
Springer
13 years 7 months ago
2010
Springer
The paper reconsiders the autoregressive aided periodogram bootstrap (AAPB) which has been suggested in Kreiß and Paparoditis (2003). Their idea was to combine a time domain param...