3204 search results - page 279 / 641 » The b-chromatic Number of a Graph |
99
Voted
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
We study the problem of distributed control of a large network of double-integrator agents to maintain a rigid formation. A few lead vehicles are given information on the desired t...
121
click to vote
WWW
2007
ACM
16 years 1 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
123
click to vote
STACS
2007
Springer
15 years 7 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
112
click to vote
APPROX
2010
Springer
15 years 2 months ago
2010
Springer
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
CCR
2004
15 years 20 days ago
2004
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...