Sciweavers

Share
13 search results - page 1 / 3
» latin 2016
Sort
View
DAM
2016
74views more  DAM 2016»
3 years 22 days ago
On the number of transversals in latin squares
The logarithm of the maximum number of transversals over all latin squares of order n is greater than n 6 (ln n + O(1)).
Vladimir N. Potapov
EJC
2016
3 years 21 days ago
Constructions of transitive latin hypercubes
A function
Denis S. Krotov, Vladimir N. Potapov
LATIN
2016
Springer
3 years 16 days ago
Graph Drawings with One Bend and Few Slopes
We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of diļ¬€erent slopes used by all segments of thes...
Kolja Knauer, Bartosz Walczak
LATIN
2016
Springer
3 years 16 days ago
Tree Compression Using String Grammars
We study the compressed representation of a ranked tree by a straight-line program (SLP) for its preorder traversal string, and compare it with the previously studied representatio...
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric No...
LATIN
2016
Springer
3 years 16 days ago
Generating Random Spanning Trees via Fast Matrix Multiplication
We consider the problem of sampling a uniformly random spanning tree of a graph. This is a classic algorithmic problem for which several exact and approximate algorithms are known....
Nicholas J. A. Harvey, Keyulu Xu
books