Sciweavers

66 search results - page 3 / 14
» Power Domination in Product Graphs
Sort
View
COMBINATORICS
2000
85views more  COMBINATORICS 2000»
13 years 7 months ago
Inequality Related to Vizing's Conjecture
Let (G) denote the domination number of a graph G and let G H denote the Cartesian product of graphs G and H. We prove that (G)(H) 2(G H) for all simple graphs G and H. 2000 Math...
W. Edwin Clark, Stephen Suen
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
13 years 5 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
CORR
2002
Springer
144views Education» more  CORR 2002»
13 years 7 months ago
Polynomial Time Data Reduction for Dominating Set
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier
DM
2008
58views more  DM 2008»
13 years 7 months ago
The vertex isoperimetric problem for the powers of the diamond graph
We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
Sergei L. Bezrukov, Miquel Rius, Oriol Serra
DAC
2004
ACM
14 years 8 months ago
Simultaneous optimization of supply and threshold voltages for low-power and high-performance circuits in the leakage dominant e
Electrothermal couplings between supply voltage, operating frequency, power dissipation and die temperature have been shown to significantly impact the energy-delay-product (EDP) ...
Anirban Basu, Sheng-Chih Lin, Vineet Wason, Amit M...