Encodings of Planar Graphs with Query Support via Orderly Spanning Tree and New Auxiliary strings for Parenthesis
碩士 === 國立中正大學 === 資訊工程研究所 === 88 === Let G be an n-node m-edge planar graph that has no self-loops. Under the O(logn)-bit word model of computation, we give the best known encoding S of G such that (a) S and G can be obtained from each other in O(m+n) time, (b) the degree of a node and the adjacency...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2000
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/48091711873054155090 |