Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CORR
2010
Springer
96views Education» more  CORR 2010»
11 years 9 months ago
A tight bound on the worst-case number of comparisons for Floyd's heap construction algorithm
Abstract. In this paper a tight bound on the worst-case number of comparisons for Floyd's well known heap construction algorithm, is derived. It is shown that at most 2n - 2
Ioannis K. Paparrizos
DM
2000
91views more  DM 2000»
11 years 11 months ago
Perfection thickness of graphs
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.
Hirotsugu Asari, Tao Jiang, André Künd...
books