934 search results - page 187 / 187 » exact 2007 |
JCT
2010
14 years 8 months ago
2010
Abstract. A weighting of the edges of a graph is called vertexcoloring if the weighted degrees of the vertices yield a proper coloring of the graph. In this paper we show that such...
143
click to vote
IWPEC
2010
Springer
14 years 7 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
SYNTHESE
2011
14 years 4 months ago
2011
: My aim in this paper is to articulate an account of scientific modeling that reconciles pluralism about modeling with a modest form of scientific realism. The central claim of th...
110
click to vote
SIGECOM
2011
ACM
14 years 11 days ago
2011
ACM
Suppose a principal Alice wishes to reduce her uncertainty regarding some future payoff. Consider a self-proclaimed expert Bob that may either be an informed expert knowing an ex...