On recognizing and characterizing visibility graphs of simple polygons

被引：0
|
作者：
S. K. Ghosh
机构：
[1] Tata Institute of Fundamental Research,Computer Science Group
来源：
Discrete & Computational Geometry | 1997年 / 17卷
关键词：
Hamiltonian Cycle; Chordal Graph; Simple Polygon; Visibility Graph; Perfect Graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper we establish four necessary conditions for recognizing visibility graphs of simple polygons and conjecture that these conditions are sufficient. We present an 0(n2)-time algorithm for testing the first and second necessary conditions and leave it open whether the third and fourth necessary conditions can be tested in polynomial time. We also show that visibility graphs of simple polygons do not possess the characteristics of a few special classes of graphs
引用
收藏
页码：143 / 162
页数：19
相关论文
共 50 条
12345