LATIN
8 years 6 months ago
2016 Springer
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...
LATIN
8 years 6 months ago
2016 Springer
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 different slopes used by all segments of thes...
LATIN
8 years 6 months ago
2016 Springer
:00 Simple realizability of complete abstract topological graphs simplified. Jan Kynˇcl. 11:00-11:30 Coffee break · · · · · · · · · · · · · · · · · · · · · ...
LATIN
8 years 6 months ago
2016 Springer
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....
LATIN
8 years 6 months ago
2016 Springer
We study information gathering in ad-hoc radio networks. Initially, each node of the network has a piece of information called a rumor, and the overall objective is to gather all t...
|