A Linear-Time Algorithm for Roman Domination Problem on Bounded Treewidth Graphs
碩士 === 國立東華大學 === 資訊工程學系 === 95 === A Roman dominating function on a graph G = (V, E) is a function f : V → f(0, 1, 2) satisfying that every vertex u with f(u) = 0 has a neighbor v with f(v) = 2. The weight of the Roman dominating function f is the sum of f(v) for the vertices belonging to V. The Ro...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/7hcap9 |