3204 search results - page 329 / 641 » The b-chromatic Number of a Graph |
209
Voted
SPAA
2003
ACM
16 years 1 days ago
2003
ACM
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
146
click to vote
RSA
2010
15 years 5 months ago
2010
We show that the number of vertices of a given degree k in several kinds of series-parallel labelled graphs of size n satisfy a central limit theorem with mean and variance proport...
223
Voted
FCS
2009
15 years 4 months ago
2009
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...
209
click to vote
COLT
2010
Springer
15 years 4 months ago
2010
Springer
We investigate the problem of active learning on a given tree whose nodes are assigned binary labels in an adversarial way. Inspired by recent results by Guillory and Bilmes, we c...
167
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...