Efficient Minus Domination on Proper Interval Graphs
碩士 === 國立中正大學 === 資訊工程研究所 === 90 === An efficient minus dominating function of a graph G = (V, E) is defined as a function f : V -> {-1, 0, 1} such that all sum of f(N[v]) = 1, where N[v] consists of v and all vertices adjacent to v. The efficient minus domination problem is to find an efficient...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2002
|
Online Access: | http://ndltd.ncl.edu.tw/handle/19041527244346735516 |
id |
ndltd-TW-090CCU00392075 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-090CCU003920752015-10-13T12:47:25Z http://ndltd.ncl.edu.tw/handle/19041527244346735516 Efficient Minus Domination on Proper Interval Graphs 嚴格區段圖上之有效負支配集問題研究 Bing-Heng Du 杜秉恒 碩士 國立中正大學 資訊工程研究所 90 An efficient minus dominating function of a graph G = (V, E) is defined as a function f : V -> {-1, 0, 1} such that all sum of f(N[v]) = 1, where N[v] consists of v and all vertices adjacent to v. The efficient minus domination problem is to find an efficient minus dominating function of G. This problem is NP-hard for general graphs, even when restricted to chordal graphs, chordal bipartite graphs, planar bipartite graphs and planar graphs of maximum degree 4. In this paper, we present an O(n2) algorithm to solve the efficient minus domination problem on proper interval graphs. Maw-Shang Chang 張貿翔 2002 學位論文 ; thesis 24 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立中正大學 === 資訊工程研究所 === 90 === An efficient minus dominating function of a graph G = (V, E) is defined as a function f : V -> {-1, 0, 1} such that all sum of f(N[v]) = 1, where N[v] consists of v and all vertices adjacent to v. The efficient minus domination problem is to find an efficient minus dominating function of G. This problem is NP-hard for general graphs, even when restricted to chordal graphs, chordal bipartite graphs, planar bipartite graphs and planar graphs of maximum degree 4. In this paper, we present an O(n2) algorithm to solve the efficient minus domination problem on proper interval graphs.
|
author2 |
Maw-Shang Chang |
author_facet |
Maw-Shang Chang Bing-Heng Du 杜秉恒 |
author |
Bing-Heng Du 杜秉恒 |
spellingShingle |
Bing-Heng Du 杜秉恒 Efficient Minus Domination on Proper Interval Graphs |
author_sort |
Bing-Heng Du |
title |
Efficient Minus Domination on Proper Interval Graphs |
title_short |
Efficient Minus Domination on Proper Interval Graphs |
title_full |
Efficient Minus Domination on Proper Interval Graphs |
title_fullStr |
Efficient Minus Domination on Proper Interval Graphs |
title_full_unstemmed |
Efficient Minus Domination on Proper Interval Graphs |
title_sort |
efficient minus domination on proper interval graphs |
publishDate |
2002 |
url |
http://ndltd.ncl.edu.tw/handle/19041527244346735516 |
work_keys_str_mv |
AT binghengdu efficientminusdominationonproperintervalgraphs AT dùbǐnghéng efficientminusdominationonproperintervalgraphs AT binghengdu yángéqūduàntúshàngzhīyǒuxiàofùzhīpèijíwèntíyánjiū AT dùbǐnghéng yángéqūduàntúshàngzhīyǒuxiàofùzhīpèijíwèntíyánjiū |
_version_ |
1716867320454840320 |