554 search results - page 42 / 111 » Power Domination Problem in Graphs |
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
IJCAI
2007
13 years 9 months ago
2007
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We develop new structural results for apex-minor-free graphs and show their power by developing two new approximation algorithms. The first is an additive approximation for colorin...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Region based features are getting popular due to their higher descriptive power relative to other features. However, real world images exhibit changes in image segments capturing ...
NIPS
2004
13 years 9 months ago
2004
Given a directed graph in which some of the nodes are labeled, we investigate the question of how to exploit the link structure of the graph to infer the labels of the remaining u...