**Current Issue**

# Special Issue "Graph Algorithms"

A special issue of *Algorithms* (ISSN 1999-4893).

Deadline for manuscript submissions: **closed (31 October 2012)**

## Special Issue Editor

*Guest Editor*

**Dr. Jesper Jansson**

Akutsu Laboratory (Laboratory of Mathematical Bioinformatics), Bioinformatics Center, Institute for Chemical Research, Kyoto University, Uji Campus, Gokasho, Uji, Kyoto 611-0011, Japan

Website: http://sunflower.kuicr.kyoto-u.ac.jp/~jj/

E-Mail: jj@kuicr.kyoto-u.ac.jp

Phone: +81 (0)3 5978 5534 **Interests:** graph algorithms; phylogenetics; approximation algorithms; combinatorial optimization

## Special Issue Information

Dear Colleagues,

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. 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. We hereby invite papers presenting original research on graph algorithms to this special issue and hope to receive many high-quality submissions.

Dr. Jesper Jansson*Guest Editor*

## Keywords

- computational complexity
- approximation algorithms
- fixed-parameter tractability
- compact data structures for graphs
- pattern matching in graphs
- graph coloring
- graph partitioning
- graph drawing
- network flow
- fast algorithms for special graph classes

Last update: 20 February 2014

*Algorithms*EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert