Share Your Research, Maximize Your Social Impacts
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: 2016-03-05
Authors : G. Nirmala; C. Sujatha;
Page : 99-103
Keywords : Steiner tree; satisfiability; NP-complete; Coxeter graph;
Source : Download
Find it from : Google Scholar
Abstract
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.
Other Latest Articles
- Study on the Effects of Marine Clay Stabilized with Banana Fibre
- Stabilization of Marine Clay Using Jerofix
- Web Based Security Analysis of oPass Authentication System Using Mobile Application
- A Study on Stabilization of Marine Dredged Soil Using Quarry Dust
- Effective Water Distribution by MIS and Canal Automation
Last modified: 2021-07-08 15:34:47