4865 search results - page 300 / 973 » The Complexity of Graph Connectivity |
140
click to vote
CDC
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
136
click to vote
FCT
2005
Springer
16 years 6 days ago
2005
Springer
A partitioning of a set of n items is a grouping of these items into k disjoint, equally sized classes. Any partition can be modeled as a graph. The items become the vertices of th...
161
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We observe a certain random process on a graph ”locally”, i.e., in the neighborhood of a node, and would like to derive information about ”global” properties of the graph....
181
click to vote
EUROMICRO
1998
IEEE
15 years 11 months ago
1998
IEEE
The paper presents an approach to process scheduling for embedded systems. Target architectures consist of several processors and ASICs connected by shared busses. We have develop...
167
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...