3008 search results - page 288 / 602 » Independence in connected graphs |
193
Voted
ICPR
2008
IEEE
16 years 8 months ago
2008
IEEE
A framework for mapping a polar-like coordinate system to a non-rigid shape is presented. Using a graph pyramid, a binary shape is decomposed into connected parts, based on its st...
172
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
— This work studies how the randomized gossip algorithm can solve the average consensus problem on networks with quantized communications. The algorithm is proved to converge to ...
200
click to vote
SPAA
2003
ACM
15 years 12 months ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
153
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
161
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Given an (undirected) graph G = V; E; a clique of G is a subset of vertices in which every pair is connected by an edge. The problem of finding a clique of maximum size is a class...