Minimum Fill-in on Circle and Circular-Arc Graphs

By Kloks T.   Kratsch D.   Wong C.K.  

Journal of Algorithms, Vol. 28, Iss. 2, 1998-08 ,pp. : 272-289

Academic Press

Access to resources Recommend Favorite

An (n log n) algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions

By  

Optimization, Vol. 64, Iss. 3, 2015-03 ,pp. : 595-602

Taylor & Francis Ltd

Access to resources Recommend Favorite

An in-place heapsort algorithm requiring n log n + n log* n −0.546871 n comparisons

By Hasan Md. Mahbubul  

International Journal of Computer Mathematics, Vol. 88, Iss. 16, 2011-11 ,pp. : 3350-3360

Taylor & Francis Ltd

Access to resources Recommend Favorite

Phased local search for the maximum clique problem

By Pullan Wayne  

Journal of Combinatorial Optimization, Vol. 12, Iss. 3, 2006-11 ,pp. : 303-323

Springer Publishing Company

Access to resources Recommend Favorite

An O(n³)-Time Recognition Algorithm for hhds-free Graphs

By Eschen Elaine   Hoàng Chính   Sritharan R.  

Graphs and Combinatorics, Vol. 23, Iss. 1, 2007-06 ,pp. : 209-231

Springer Publishing Company

Access to resources Recommend Favorite