Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs

Author： Hota Mrinmoy   Pal Madhumangal   Pal Tapan K.  

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.27, Iss.1, 2004-01, pp. : 95-113

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

OPTIMAL SEQUENTIAL AND PARALLEL ALGORITHMS TO COMPUTE A STEINER TREE ON PERMUTATION GRAPHS

By MONDAL S.   PAL M.   PAL T.  

International Journal of Computer Mathematics, Vol. 80, Iss. 8, 2003-08 ,pp. : 937-943

Taylor & Francis Ltd

Access to resources Recommend Favorite

Uncountable graphs with all their vertices in one face

By Boza Luis   Fedriani Eugenio M.   Núńez Juan  

Acta Mathematica Hungarica, Vol. 112, Iss. 4, 2006-09 ,pp. : 307-313

Springer Publishing Company

Access to resources Recommend Favorite

An Efficient Algorithm to Generate all Maximal Cliques on Trapezoid Graphs

By Bera D.   Pal M.   Pal T.  

International Journal of Computer Mathematics, Vol. 79, Iss. 10, 2002-01 ,pp. : 1057-1065

Taylor & Francis Ltd

Access to resources Recommend Favorite

On graphs in which all neighborhoods of vertices are locally pseudocyclic graphs

By Kabanov V.   Makhnev A.  

Doklady Mathematics, Vol. 89, Iss. 1, 2014-01 ,pp. : 76-79

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

On the Maximum Zagreb Indices of Graphs with k Cut Vertices

By Zhao Qin   Li Shuchao  

Acta Applicandae Mathematicae, Vol. 111, Iss. 1, 2010-07 ,pp. : 93-106

Springer Publishing Company

Access to resources Recommend Favorite