Titlebook: Experimental Algorithms; 14th International S Evripidis Bampis Conference proceedings 2015 Springer International Publishing Switzerland 20

SOBER

Tree Compression with Top Trees Revisitedan in-memory representation that supports basic navigation operations in worst-case logarithmic time without decompression. We also show a much improved worst-case bound on the size of the output of top-tree compression (answering an open question posed in a talk on this algorithm by Weimann in 2012).

GRAZE

Greedily Improving Our Own Centrality in A Networkal-time approximation scheme (unless .), and we then propose a simple greedy approximation algorithm (with an almost tight approximation ratio), whose performance is then tested on synthetic graphs and real-world networks.

并排上下

Graph Partitioning for Independent Setsets. To enhance newly computed offsprings we combine our operators with a local search algorithm. Our experimental evaluation indicates that we are able to outperform state-of-the-art algorithms on a variety of instances.

Tremor

0302-9743 grouped in topical sections on data structures, graph problems, combinatorial optimization, scheduling and allocation, and transportation networks..978-3-319-20085-9978-3-319-20086-6Series ISSN 0302-9743 Series E-ISSN 1611-3349

CAPE

interior

cochlea

GULF

flutter

Jeffrey Henry,Michel Boivin,George Tarabulsystant time. However, their construction time remains a bottleneck. We introduce a practical parallel algorithm that improves the state of the art in succinct tree construction. Given a tree on . nodes stored as a sequence of balanced parentheses, our algorithm builds a succinct tree representation i

aerial

Patrick H. Tolan,Bennett L. Leventhaleducing the amount of information stored and guiding the compression step using a RePair-inspired heuristic, we obtain a fast compressor achieving good compression ratios, addressing an open problem posed by [.]. We show how, with relatively small overhead, the compressed file can be converted into