ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

A Steiner Problem in Coxeter Graph Which is NP ? Complete

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

Publication Date:

Authors : ; ;

Page : 99-103

Keywords : Steiner tree; satisfiability; NP-complete; Coxeter graph;

Source : Downloadexternal Find it from : Google Scholarexternal


Our objects in this work is to obtain complexity theory, a specific problem known as Steiner problem in Coxeter graph which is NP complete and also it is worth mentioning that our result every full component of a Steiner tree contains almost 4 terminals involved therein.

Last modified: 2021-07-08 15:34:47