Volume : 2, Issue : 8, August - 2013

A Suggestion Branch–and–Bound Technique for MOPS

B. Nikfarjam

Abstract :

Outer planar graph are a widely studied graph class with application in graph drawing [1, 2] and with intersecting theoretical properties [3, 4, 5]. The maximum outer planar sub graph problem (MOPS) is NP–hard. The problem of finding a MPS has important application in circuit layout ,automated graph drawing, and facility layout .the maximum planar sub graph problem(MPS) is too NP–hard. In this article we present anch – and– bound technique for finding MPS and MOP of graph