The Fault Tolerant Domination Problem on Strongly Chordal Graphs
碩士 === 國立中正大學 === 資訊工程研究所 === 89 === Given a graph G = (V, E) and a fault tolerant function f from V to N, a dominating set D(subset of V) is fault tolerant if | D∩N[v] | >= f(v) for all v in V. Given a graph G = (V, E) and a function g,from V to integers, the weight of g is defined as...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2001
|
Online Access: | http://ndltd.ncl.edu.tw/handle/89509799514631971665 |