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

Nostalgia

Parallel Construction of Succinct Treesstant 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

輕快來(lái)事

只有

悅耳

Greedily Improving Our Own Centrality in A Networkness or betweenness centrality can have positive impact on the vertex itself: hence, in this paper we consider the problem of determining how much a vertex can increase its centrality by creating a limited amount of new edges incident to it. We first prove that this problem does not admit a polynomi

Encephalitis

An Exact Algorithm for Diameters of Large Real Directed Graphsd for general directed graphs, i.e., it does not assume that given graphs are undirected or strongly connected. Experimental results on large real graphs show that the proposed algorithm is several orders of magnitude faster than the naive approach, and it reveals the exact diameters of large real d

Cultivate

Graph Partitioning for Independent Setse the problem. The core innovations of the algorithm are very natural combine operations based on graph partitioning and local search algorithms. More precisely, we employ a state-of-the-art graph partitioner to derive operations that enable us to quickly exchange whole blocks of given independent s