3008 search results - page 212 / 602 » Independence in connected graphs |
176
click to vote
ICSE
2009
IEEE-ACM
16 years 1 months ago
2009
IEEE-ACM
Social networking systems help people maintain connections to their friends, enabling awareness, communication, and collaboration, especially at a distance. In many studies of coo...
165
click to vote
CAIP
2009
Springer
16 years 1 months ago
2009
Springer
Segmentation of Nom characters from body text regions of stele images is a challenging problem due to the confusing spatial distribution of the connected components composing these...
173
click to vote
DISOPT
2008
15 years 6 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
192
click to vote
TSMC
2010
15 years 1 months ago
2010
Abstract--This paper considers a second-order consensus problem for multiagent systems with nonlinear dynamics and directed topologies where each agent is governed by both position...
155
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...