DocumentCode :
2750548
Title :
An Algorithm for Visibility Graph Recognition on Special Case
Author :
Dehghani, Gholamreza ; Morady, Hossein
Author_Institution :
Islamic Azad Univ., Isfahan, Iran
fYear :
2009
fDate :
3-5 April 2009
Firstpage :
209
Lastpage :
211
Abstract :
In this paper, visibility graph recognition problem will be attended. Since, in graph theory, this problem is a famous open problem and because of complexity, no solution has been found for it, so far. Therefore here it is restricted to the special class of graphs and then solved.Because of having related properties with main problem, one special case was chosen. Finally an approach for visibility graph recognition on this special case of graphs has been developed. Proposed approach gets graphs which satisfy this special case and recognizes whether it is a visibility graph.
Keywords :
computational geometry; graph theory; computational geometry; graph theory; visibility graph recognition; Computational geometry; Graph theory; Graphics; Robots; Spirals; Computational geometry; Polygon; Visibility graph; graph; interval graph;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Future Computer and Communication, 2009. ICFCC 2009. International Conference on
Conference_Location :
Kuala Lumpar
Print_ISBN :
978-0-7695-3591-3
Type :
conf
DOI :
10.1109/ICFCC.2009.131
Filename :
5189774
Link To Document :
بازگشت