R-Restricted Steiner Problem is NP-Complete

Apply

R-Restricted Steiner Problem is NP-Complete

Journal Title: International Journal of Science and Research (IJSR) - Year 2015, Vol 4, Issue 4

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.

Authors and Affiliations

Keywords

Sonographic Assessment of Endometrial Thickness in Different Menstrual Stages in Sudanese Normal Women in Khartoum State

Maximum Power Generation by Integrating Solar & Wind System Using Fuzzy for Voltage Regulation in Smart Grid

This paper presents the voltage regulation of hybrid power system with the inter connection of PV system, wind energy conversion system. The voltage regulation is done with the help of fuzzy logic controller and zeta con...

Mathematical Modeling of Three-Link Bipedal Robot

Web Based Security using Online Password Authentication in Mobile Application

The internet has one of the most convenient and widely used media for people for exchanging information and to do business over the internet. E.g. Accessing web based emails, online auction or banking sites. But now a da...

Detection of Malaria Parasite Using Different Microscopic Methods and Acomparison Among Them

Malaria is a leading cause of morbidity and mortality worldwide. Prompt diagnosis and treatment are critical factors in reducing morbidity and mortality, as delayed treatment of malaria increases the risk of death. Micro...

EP ID EP366415
DOI -
Views 105
Downloads 0