A Steiner Problem in Petersen Graph Which is NP - Complete

Journal: International Journal of Scientific Engineering and Research (IJSER) (Vol.3, No. 7)

Publication Date: 2015-07-05

Authors : G. Nirmala; C. Sujatha;

Page : 216-219

Keywords : steiner minimum treeNP-completesatisfiablitypetersen graph;

Source : Download Find it from : Google Scholar

Abstract

In this paper, we will discuss complexity theory, a specific problem known as R-Restricted steiner problem in petersen graph is Np-complete and also every full component of a steiner tree contains almost 4 terminals.

Main Menu

Searching By

PARTNERS

A Steiner Problem in Petersen Graph Which is NP - Complete

Abstract

Advertisement