chapter 7 planar graphs 大葉大學 資訊工程系 黃鈴玲 2011.12. 7.2 planar embeddings …
Post on 20-Jan-2018
228 Views
Preview:
DESCRIPTION
(1) circuit layout problems (2) Three house and three utilities( 水電瓦斯 ) problem A graph that can be drawn in the plane without any of its edges intersecting is called a planar graph. A graph that is so drawn in the plane is also said to be embedded ( 嵌入 ) in the plane. 3 Definition Applications:
top related