|
|
|
(3.22.171.136)
|
|
Users online: 9006
|
|
|
|
|
|
|
Ijournet
|
|
|
|
|
|
|
Transforming 3SAT to Steiner problem in planar graph which is NP-complete Dr. Nirmala G.*, Sujatha C.** *Head & Associate Professor, PG & Research, Dept. of Mathematics, K.N. Govt. Arts College for women (Autonomous), Thanjavur-613007. (Tamilnadu) **Research Scholar, Dept. of Mathematics, K.N. Govt. Arts College for women (Autonomous), Thanjavur-613007 Online published on 10 February, 2015. Abstract Complexity theory has many facts. In this work, we propose an NP-completeness result for the Steiner problem in planar graphs. Top Keywords Planar graph, NP-complete, Steiner problem in planar graph, 3-Satisfiability. Top | |
|
|
|
|
║ Site map
║
Privacy Policy ║ Copyright ║ Terms & Conditions ║
|
|
|
743,950,097 visitor(s) since 30th May, 2005.
|
|
All rights reserved. Site designed and maintained by DIVA ENTERPRISES PVT. LTD..
|
|
Note: Please use Internet Explorer (6.0 or above). Some functionalities may not work in other browsers.
|