4171 search results - page 103 / 835 » Choice numbers of graphs |
138
click to vote
SSS
2010
Springer
15 years 4 months ago
2010
Springer
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
179
click to vote
JSYML
2010
15 years 1 months ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
131
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
179
click to vote
UAI
2004
15 years 7 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
198
click to vote
AGTIVE
2007
Springer
16 years 18 days ago
2007
Springer
In this article, we propose to use the Discrete EVent system Specification (DEVS) formalism to describe and execute graph transformation control structures. We provide a short rev...