Finding the Visibility Representation of Plane Graph by DFS
碩士 === 國立暨南國際大學 === 資訊工程學系 === 96 === Let G be an n-node planar graph. In a visibility representation of G, each node of G is represented by a horizontal segment such that the segments representing any two adjacent nodes of G are vertically visible to each other. In this thesis, we design a heurist...
Main Authors: | Hsin-Yi Chen, 陳欣毅 |
---|---|
Other Authors: | Yue-Li Wang |
Format: | Others |
Language: | zh-TW |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/40173564112773354108 |
Similar Items
-
Space-Efficient Fully Dynamic DFS in Undirected Graphs <sup>†</sup>
by: Kengo Nakamura, et al.
Published: (2019-02-01) -
Visibility Representations of Four-Connected Plane Graphs with Near Optimal Heights
by: Ya-Fei Hung, et al.
Published: (2008) -
An approach to choosing the right distributed file system : Microsoft DFS vs. Hadoop DFS
by: Musatoiu, Mihai
Published: (2015) -
Functional characterization of two defensins, HlDFS1 and HlDFS2, from the hard tick Haemaphysalis longicornis
by: Ta Sun, et al.
Published: (2017-10-01) -
Sound Absorption Properties of DFs/EVA Composites
by: Lihua Lyu, et al.
Published: (2019-05-01)