721 search results - page 37 / 145 » Bounds on the k-domination number of a graph |
143
click to vote
COLT
2010
Springer
14 years 12 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...
DM
2006
15 years 2 months ago
2006
In 1985, Erdos and Ne
107
click to vote
COMBINATORICS
2006
15 years 2 months ago
2006
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
DAM
2008
15 years 2 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
CORR
2004
Springer
15 years 1 months ago
2004
Springer
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...