Sciweavers

150 search results - page 2 / 30
» Traversing a set of points with a minimum number of turns
Sort
View
JGAA
2006
127views more  JGAA 2006»
13 years 4 months ago
A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa,...
CCCG
2007
13 years 6 months ago
On the Number of Empty Pseudo-Triangles in Point Sets
We analyze the minimum and maximum number of empty pseudo-triangles defined by any planar point set. We consider the cases where the three convex vertices are fixed and where th...
Marc J. van Kreveld, Bettina Speckmann
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
13 years 4 months ago
Drawing a Graph in a Hypercube
A d-dimensional hypercube drawing of a graph represents the vertices by distinct points in {0, 1}d, such that the line-segments representing the edges do not cross. We study lower...
David R. Wood
BMCBI
2006
157views more  BMCBI 2006»
13 years 4 months ago
Determination of the minimum number of microarray experiments for discovery of gene expression patterns
Background: One type of DNA microarray experiment is discovery of gene expression patterns for a cell line undergoing a biological process over a series of time points. Two import...
Fang-Xiang Wu, W. J. Zhang, Anthony J. Kusalik
DIS
2007
Springer
13 years 10 months ago
On Approximating Minimum Infrequent and Maximum Frequent Sets
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et a...
Mario Boley