Abstract:
Complexity theory has many facts. Its motivations and goals however, are similar; to determine the computational “difficulty” or complexity of a problem. In this work, we propose an NP- completeness proof for the Steiner tree problem in graphs
Reference this Research Paper (copy & paste below code):
Dr. G. Nirmala, C. Sujatha (2018); Every u-v path of NP-complete Steiner graphs contains exactly 2n-edges;
Int J Sci Res Publ 4(9) (ISSN: 2250-3153). http://www.ijsrp.org/research-paper-0914.php?rp=P333077
