Canonical Spanning Trees for Planar Graphs with Application to Graph Encoding
碩士 === 國立中正大學 === 資訊工程研究所 === 87 === Let G be an n-node m-edge planar graph that may contain multiple edges. We show that there exists an encoding code(G) of G such that (1) code(G) has 2m+3n+o(m+n) bits; (2) code(G) can be obtained from G in O(m+n^2) time...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1999
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/39131628092351097801 |