4171 search results - page 431 / 835 » Choice numbers of graphs |
157
click to vote
ESANN
2007
15 years 8 months ago
2007
A recently proposed nonlinear extension of Granger causality is used to map the dynamics of a neural population onto a graph, whose community structure characterizes the collective...
223
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...
204
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 ...
209
click to vote
DM
2002
15 years 6 months ago
2002
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...