3008 search results - page 197 / 602 » Independence in connected graphs |
188
click to vote
WADS
2005
Springer
16 years 1 days ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
157
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
174
click to vote
CN
2008
15 years 6 months ago
2008
Capacity is an important property for QoS support in Mobile Ad Hoc Networks (MANETs) and has been extensively studied. However, most approaches rely on simplified models (e.g., pr...
164
click to vote
JAIR
2008
15 years 6 months ago
2008
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
201
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...