Share Your Research, Maximize Your Social Impacts
R-Restricted Steiner Problem is NP-Complete
Journal: International Journal of Science and Research (IJSR) (Vol.4, No. 4)Publication Date: 2015-04-05
Authors : G. Nirmala; C. Sujatha;
Page : 2164-2166
Keywords : Steiner minimum tree; NP-complete; R-restricted Steiner tree; satisfiability;
Source : Download
Find it from : Google Scholar
Abstract
This work aims to arrive a Steiner minimum tree with -terminals. Every full component of a Steiner tree contains almost 4 terminals. In this work, we propose to flash R-restricted Steiner problem which is NP-complete.
Other Latest Articles
- Burrowing Habit Play Thermoregulation Role in Geolycosa Montgomery, T. H., 1904 (Araneae, Lycosidae).
- Synergistic Effects of AMF and Bacilluslehensis Strain MLB2 on Ocimum sanctum Grown under Fluoride Stress
- Discovering the Black Stone was Placed for Holy Mosque of Kufa Using GPR
- Automatic Reactive Power Flow Control in 100MW Turbo Generator
- Study of Optical Properties of (PVA-PVAC-Rice Shell) Composites
Last modified: 2021-06-30 21:44:39