3204 search results - page 290 / 641 » The b-chromatic Number of a Graph |
120
click to vote
PODC
2012
ACM
13 years 3 months ago
2012
ACM
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
121
click to vote
ECCC
2010
14 years 10 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
106
click to vote
HPDC
2009
IEEE
15 years 7 months ago
2009
IEEE
Since the advent of electronic computing, the processors’ clock speed has risen tremendously. Now that energy efficiency requirements have stopped that trend, the number of proc...
120
click to vote
KDD
2008
ACM
16 years 1 months ago
2008
ACM
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
110
click to vote
SDM
2009
SIAM
15 years 10 months ago
2009
SIAM
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...