Research Paper | Mathematics | India | Volume 4 Issue 4, April 2015
R-Restricted Steiner Problem is NP-Complete
Dr. G. Nirmala, C. Sujatha
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.
Keywords: Steiner minimum tree, NP-complete, R-restricted Steiner tree, satisfiability
Edition: Volume 4 Issue 4, April 2015
Pages: 2164 - 2166
How to Cite this Article?
Dr. G. Nirmala, C. Sujatha, "R-Restricted Steiner Problem is NP-Complete", International Journal of Science and Research (IJSR), https://www.ijsr.net/search_index_results_paperid.php?id=SUB153555, Volume 4 Issue 4, April 2015, 2164 - 2166
Similar Articles with Keyword 'minimum'
Solvency and Reinsurance Treaty of an Automobile Portfolio: Case of Sub-Saharian Countries
Bukanga Maheshe Crispin, Mabela Makengo Matendo Rostin
Bounds on Inverse and Double Domination Numbers of Fuzzy Square Graphs
N. Sarala, T. Kavitha
Similar Articles with Keyword 'tree'
Multi-Factor Model Base on the Minimal Spanning Tree
K-Even Sequential Harmonious Labeling of Some Cycle Related Graphs
B. Gayathri, D. Muthuramakrishnan