This article is
- freely available
Editorial: Special Issue on Graph Algorithms
Laboratory of Mathematical Bioinformatics, Bioinformatics Center, Institute for Chemical Research, Kyoto University, Gokasho, Uji, Kyoto 611-0011, Japan
Received: 9 August 2013; in revised form: 9 August 2013 / Accepted: 9 August 2013 / Published: 12 August 2013
This special issue of Algorithms is devoted to the design and analysis of algorithms for solving combinatorial problems of a theoretical or practical nature involving graphs, with a focus on computational complexity.
graph algorithms; computational complexity; fixed-parameter tractability; exact algorithms; approximation algorithms; heuristics; computational studies
Because of their simplicity and generality, graphs have been used for a long time in many different areas of science and engineering, e.g., to describe how objects such as the atoms of a molecule are connected, or to express various types of constraints such as precedence constraints in a complex manufacturing process. More recently, graphs have found new applications in emerging research fields like social network analysis, the design of robust computer network topologies, frequency allocation in wireless networks, and bioinformatics (i.e., to represent metabolic pathways, protein–protein interactions, evolutionary relationships, or other kinds of structured biological information). The amount of data in such applications can be enormous, and therefore, the resulting graphs may be huge, which motivates further development of fast and space-efficient algorithms in the near future for solving various (old and new) graph problems exactly or approximately.
2. Special Issue
A special issue of Algorithms
was proposed in order to stimulate new and original research on graph algorithms. In response to the call for papers, researchers from all over the world submitted a total of fifteen articles, covering a wide range of related topics. All submissions were evaluated by experts; based on their anonymous reviews, nine of the articles were then selected for inclusion in the special issue. After several rounds of revision, the final versions were published in [1
As Guest Editor of this Special Issue, I would like to thank all of the contributing authors for submitting their work to Algorithms; the reviewers for their valuable and detailed comments that helped us select the best articles; and the publishers, Editor-in-Chief Professor Kazuo Iwama, and Assistant Editors Ms. Chelly Cheng, Ms. Wanda Gruetter, Ms. Maple Lv, and Ms. Phoenix Zhao for their support and assistance.
References and Notes
- Prosser, P. Exact Algorithms for Maximum Clique: A Computational Study. Algorithms 2012, 5, 545–587. [Google Scholar] [CrossRef]
- Toda, T. Extracting Co-Occurrence Relations from ZDDs. Algorithms 2012, 5, 654–667. [Google Scholar] [CrossRef]
- Bonizzoni, P.; Dondi, R.; Pirola, Y. Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability. Algorithms 2013, 6, 1–11. [Google Scholar] [CrossRef]
- Marzban, M.; Gu, Q.-P. Computational Study on a PTAS for Planar Dominating Set Problem. Algorithms 2013, 6, 43–59. [Google Scholar] [CrossRef]
- Uehara, R. Tractabilities and Intractabilities on Geometric Intersection Graphs. Algorithms 2013, 6, 60–83. [Google Scholar] [CrossRef]
- Isaacs, J.T.; Hespanha, J.P. Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach. Algorithms 2013, 6, 84–99. [Google Scholar] [CrossRef]
- Takes, F.W.; Kosters, W.A. Computing the Eccentricity Distribution of Large Graphs. Algorithms 2013, 6, 100–118. [Google Scholar] [CrossRef]
- Akutsu, T.; Tamura, T. A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree. Algorithms 2013, 6, 119–135. [Google Scholar] [CrossRef][Green Version]
- Tazehkand, J.S.; Hashemi, S.N.; Poormohammadi, H. New Heuristics for Rooted Triplet Consistency. Algorithms 2013, 6, 396–406. [Google Scholar] [CrossRef]
© 2013 by the authors; licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution license (http://creativecommons.org/licenses/by/3.0/).