2015 March - 6 articles
The NP-hard RAINBOW SUBGRAPH problem, motivated from bioinformatics, is to find in an edge-colored graph a subgraph that contains each edge color exactly once and has at most \(k\) vertices. We examine the parameterized complexity of RAINBOW SUBGR...
A graph is unipolar if it can be partitioned into a clique and a disjoint union of cliques, and a graph is a generalised split graph if it or its complement is unipolar. A unipolar partition of a graph can be used to find efficiently the clique numbe...
Synthetic aperture radar (SAR) image segmentation usually involves two crucial issues: suitable speckle noise removing technique and effective image segmentation methodology. Here, an efficient SAR image segmentation method considering both of the t...
The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequ...
The random time delay in a networked control system can usually deteriorate the control performance and stability of the networked control system. In order to solve this problem, this paper puts forward a networked control system random time-delay c...
The editors of Algorithms would like to express their sincere gratitude to the following reviewers for assessing manuscripts in 2014:[...]
