310 search results - page 58 / 62 » dam 2008 |
DAM
2008
13 years 10 months ago
2008
13 An induced matching of a graph G is a matching having no two edges joined by14 an edge. An efficient edge dominating set of G is an induced matching M such that15 every other ed...
Publication
Usually, binary search only makes sense in sorted arrays. We show that insertion sort based on repeated "binary searches" in an initially unsorted array also sorts n ele...
DAM
2006
13 years 10 months ago
2006
In this paper we consider a non-cooperative two-person zero-sum matrix game, called dice game. In an (n, ) dice game, two players can independently choose a dice from a collection...
DAM
2007
13 years 10 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
DAM
2007
13 years 10 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...