سال انتشار: ۱۳۹۰

محل انتشار: یازدهمین کنفرانس سیستم های فازی ایران

تعداد صفحات: ۴

نویسنده(ها):

M yunusi – Department of mathematic science national university of tajikestan
B nikfarjam – university of tajikestan
M.T yahyapour – Islamic Azad University – Ramsar -Iran
S Shanhabi – Sama technical and vocational training college Islamic Azad University – Tonekabon -Iran

چکیده:

outer planer graphs are a widely studied graph class with application in graph drawing [1,2] and with intersecting theoretical properties [3,4,5] In this paper we introduce a simulated annealing algorithm for maximal outer planer of a graph .(MOPS)