1105 search results - page 136 / 221 » Linear choosability of graphs |
158
click to vote
ESCIENCE
2006
IEEE
15 years 8 months ago
2006
IEEE
Jylab is a portable and flexible scientific computing system favoring extensibility. It provides a user with a scripting language and a core set of libraries implementing numerica...
109
click to vote
DISOPT
2008
15 years 4 months ago
2008
Abstract. Let the graph G = (V, E) be a cycle with n + 1 vertices, nonnegative vertex weights and positive edge lengths. The inverse 1-median problem on a cycle consists in changin...
136
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
141
click to vote
HEURISTICS
2002
15 years 4 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
128
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We consider linear models for stochastic dynamics. To any such model can be associated a network (namely a directed graph) describing which degrees of freedom interact under the d...