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: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/22363001906058279316 |
| Summary: | 碩士 === 國立暨南國際大學 === 資訊工程學系 === 97 === Given a graph G = (V, E), the power domination problem is to find a minimum vertex set
|
|---|