An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs

Author： Mondal Sukumar   Pal Madhumangal   Pal Tapan K.  

Publisher： Taylor & Francis Ltd

ISSN： 0020-7160

Source： International Journal of Computer Mathematics, Vol.79, Iss.2, 2002-01, pp. : 189-204

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An optimal parallel algorithm to construct a tree 3-spanner on interval graphs

By Anita Saha   Madhumangal Pal   Tapan Pal  

International Journal of Computer Mathematics, Vol. 82, Iss. 3, 2005-03 ,pp. : 259-274

Taylor & Francis Ltd

Access to resources Recommend Favorite

A New Mixed Iterative Algorithm to Solve the Fuel-Optimal Linear Impulsive Rendezvous Problem

By Arzelier D.   Louembet C.   Rondepierre A.   Kara-Zaitri M.  

Journal of Optimization Theory and Applications, Vol. 159, Iss. 1, 2013-10 ,pp. : 210-230

Springer Publishing Company

Access to resources Recommend Favorite

A 2-approximation algorithm for the vertex cover P4 problem in cubic graphs

By Li Yuchao   Tu Jianhua  

International Journal of Computer Mathematics, Vol. 91, Iss. 10, 2014-10 ,pp. : 2103-2108

Taylor & Francis Ltd

Access to resources Recommend Favorite

An algorithm to solve the proportional network flow problem

By Morrison David   Sauppe Jason   Jacobson Sheldon  

Optimization Letters, Vol. 8, Iss. 3, 2014-03 ,pp. : 801-809

Springer Publishing Company

Access to resources Recommend Favorite

Genetic algorithm to solve the p -centre and p -radius problem on a network

By Abu Nayeem SK.   Pal Madhumangal  

International Journal of Computer Mathematics, Vol. 82, Iss. 5, 2005-05 ,pp. : 541-550

Taylor & Francis Ltd

Access to resources Recommend Favorite