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
Related Articles
- EP ID EP366415
- DOI -
- Views 116
- Downloads 0
A Novel Pass Transistor Logic Based Pulse Triggered Flip-flop with Conditional Enhancement
A Novel Pass Transistor Logic Based Pulse Triggered Flip-flop with Conditional Enhancement
Accident Prevention System for Public Transport Vehicles
"Human life loss is biggest loss which cannot be recoverable unlike other property loss. Many people die every year due to road accidents. Plenty of solutions have been applied to prevent these road accidents. Government...
Assessing Economic Factors Affecting the Marketing of Tomatoes (Solanum Lycopersicum) By Smallholder Farmers at Negomo Co-Operative Society in Mazowe District of Zimbabwe
"This study investigated factors affecting the marketing of tomatoes at Negomo smallholder Cooperative in Mazowe. A descriptive quantitative survey research design was adopted and questionnaires were used to collect data...
Ethnomedicinal Practices of Koltribes in Shahdol Division Madhya Pradesh India
"A survey of ethnomedicinal plants of shahdol division has been carried out with co-operation of Kol tribal villagers. During study 31 ethnomedicinal plants have been identified for the treatment of various disease. Ha...
An Adaptive Framework towards Analyzing the Parallel Merge Sort
The parallel computing on loosely coupled architecture has been evolved now a day because of the availability of fast and, inexpensive processors and advancements in communication technologies. The aim of this paper is t...