1629 search results - page 77 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
DAGSTUHL
2007
14 years 11 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
The problem of scheduling a weighted directed acyclic graph (DAG) to a set of homogeneous processors to minimize the completion time has been extensively studied. The NPcompletene...
CVPR
2005
IEEE
15 years 12 months ago
2005
IEEE
Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel form...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...