3204 search results - page 319 / 641 » The b-chromatic Number of a Graph |
220
click to vote
DAGSTUHL
2004
15 years 8 months ago
2004
A well-studied problem in fault diagnosis is to identify the set of all good processors in a given set {p1, p2, . . . , pn} of processors via asking some processors pi to test whet...
171
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
197
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
186
click to vote
ALT
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. The importance of a node in a directed graph can be measured by its PageRank. The PageRank of a node is used in a number of application contexts
144
click to vote
RSA
2011
15 years 1 months ago
2011
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Local Lemma which c...