310 search results - page 56 / 62 » dam 2008 |
DAM
2008
13 years 10 months ago
2008
Let G = (V + s, E) be a 2-edge-connected graph with a designated vertex s. A pair of edges rs, st is called admissible if splitting off these edges (replacing rs and st by rt) pre...
DAM
2008
13 years 10 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
DAM
2008
13 years 10 months ago
2008
The intramolecular model for gene assembly in ciliates considers three operations, ld, hi, and dlad that can assemble any gene pattern through folding and recombination: the molec...
DAM
2008
13 years 10 months ago
2008
We present here a systematic study of general boundary value problems on weighted networks that includes the variational formulation of such problems. In particular, we obtain the...
DAM
2008
13 years 9 months ago
2008
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximat...