International Journal of Scientific and Research Publications

IJSRP, Volume 4, Issue 9, September 2014 Edition [ISSN 2250-3153]


Every u-v path of NP-complete Steiner graphs contains exactly 2n-edges
      Dr. G. Nirmala, C. Sujatha
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
©️ Copyright 2011-2022 IJSRP - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.