DAM
2016
10 years 1 months ago
2016
In this paper, we reÿne upper and lower bounds for the channel capacity of a serial, binary rewritable medium in which no consecutive locations may store 1’s and no consecutive...
DAM
2016
10 years 1 months ago
2016
A game starts with the empty graph on n vertices, and two player alternate adding edges to the graph. Only moves which do not create a triangle are valid. The game ends when a maxi...
DAM
2016
10 years 1 months ago
2016
Bichain graphs form a bipartite analog of split permutation graphs, also known as split graphs of Dilworth number 2. Unlike graphs of Dilworth number 1 that enjoy many nice proper...
DAM
2016
10 years 1 months ago
2016
Crane scheduling in container terminals is known as a difficult optimization problem that has become even more challenging in recent years with the proliferation of multi-gantry a...
DAM
2016
10 years 1 months ago
2016
We show that all minimal dominating sets of a chordal bipartite graph can be generated in incremental polynomial, hence output polynomial, time. Enumeration of minimal dominating ...