No 4-Connected Planar Graph Could Be a Visibility Graph
碩士 === 國立交通大學 === 應用數學研究所 === 81 === The recognition problem for visibility graphs is, given a graph, to determine whether this graph is the visibility graph of a simple polygon. It is not known whether this problem could be solved in polyn...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1993
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/78559515784860923469 |