Sciweavers

554 search results - page 6 / 111
» Power Domination Problem in Graphs
Sort
View
CORR
2010
Springer
112views Education» more  CORR 2010»
13 years 7 months ago
Approximation Algorithms for Dominating Set in Disk Graphs
We consider the problem of finding a lowest cost dominating set in a given disk graph containing n disks. The problem has been extensively studied on subclasses of disk graphs, ye...
Matt Gibson, Imran A. Pirwani
IJCM
2008
72views more  IJCM 2008»
13 years 7 months ago
ROMAN DOMINATION: a parameterized perspective
Abstract. We analyze Roman domination from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized al...
Henning Fernau
OL
2011
242views Neural Networks» more  OL 2011»
13 years 2 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
ICDE
2008
IEEE
159views Database» more  ICDE 2008»
14 years 9 months ago
Fast Graph Pattern Matching
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...
Jiefeng Cheng, Jeffrey Xu Yu, Bolin Ding, Philip S...
SSPR
2010
Springer
13 years 6 months ago
Fast Population Game Dynamics for Dominant Sets and Other Quadratic Optimization Problems
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
Samuel Rota Bulò, Immanuel M. Bomze, Marcel...