An Algorithm for Solving the Power Domination Problem on Honeycomb Meshes
碩士 === 國立暨南國際大學 === 資訊工程學系 === 97 === Given a graph G = (V, E), the power domination problem is to find a minimum vertex set
Main Authors: | Shuo-Hong Xu, 徐碩鴻 |
---|---|
Other Authors: | Yue-Li Wang |
Format: | Others |
Language: | en_US |
Published: |
2009
|
Online Access: | http://ndltd.ncl.edu.tw/handle/22363001906058279316 |
Similar Items
-
A Study on the Induced Dominating Path of Honeycomb Meshes
by: 徐俊雄
Published: (2002) -
The Incidence Coloring Algorithm for Honeycomb Meshes, Square Meshes and Hexagonal Meshes
by: Sheng-Hsiung, Chung, et al.
Published: (2003) -
Using Genetic Algorithms to Solve the Channel Allocation Problem for Wireless Mesh Networks
by: Chin-Yen Ko, et al.
Published: (2014) -
Solving Some Geometric Problems on Reconfigurable Meshes
by: Su-Chen Lin, et al.
Published: (2000) -
HIGH-ORDER FINITE ELEMENTS FOR THE NEUTRON TRANSPORT EQUATION ON HONEYCOMB MESHES
by: Calloo Ansar, et al.
Published: (2021-01-01)