Guest Editorial: Special Issue on Algorithms and Computation

Abstract

This special issue is dedicated to the themes of Algorithms and Computation. The eight papers in this issue cover a wide range of areas within the themes such as graph partitioning, graph matching, graph coloring, tree partitioning, graph minor theory, polynomial multiplication, algorithmic self-assembly, and the complexity of counting problems. The paper “Beyond good partition shapes: an analysis of diffusive graph partitioning” by Meyerhenke and Sauerwald (doi:10.1007/s00453-012-9666-y) studies the problem of graph partitioning and gives a theoretical analysis of the diffusionbased partitioning heuristic Bubble-FOS/C which yields good experimental results in practice. In the paper “Improved algorithms for even factors and square-free simple bmatchings” (doi:10.1007/s00453-012-9642-6), Babenko considers the problem of finding an even factor of maximum cardinality, which is a generalization of path matchings. He gives an improved algorithm to find a maximum cardinality even factor in an odd-cycle symmetric digraph. The paper “3-coloring AT-free graphs in polynomial time” by Stacho (doi:10.1007/ s00453-012-9624-8) deals with graph coloring and gives a polynomial time algorithm for the 3-coloring problem of asteroidal-triple-free graphs. In “Minimum cost partitions of trees with supply and demand” (doi:10.1007/ s00453-011-9573-7), Ito, Hara, Zhou and Nishizeki consider the problem of parti-