[DMANET] CFP: "Graph Algorithms" special issue of Algorithms

CALL FOR PAPERS:
"Graph Algorithms" -- A special issue of Algorithms (ISSN 1999-4893)

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, Kyoto University
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

---

Submission:
Manuscripts should be submitted online at www.mdpi.com after registering
and logging in.
Manuscripts can be submitted until the deadline.
Papers will be published continuously (as soon as accepted) and will be
listed together on the special issue website.
Research articles, review articles as well as communications are invited.
Submitted manuscripts should not have been published previously nor be
under consideration for publication elsewhere, except for in conference
proceedings.
All manuscripts are refereed through a peer-review process.
A guide for authors and other information related to the submission of
manuscripts is available on the "Instructions for authors" page.
The Article Processing Charge (APC) for publication in this open access
journal is 300 CHF (Swiss Francs).

Deadline:
The deadline for manuscript submissions is 31 October 2012.

---

About the journal:
Algorithms (ISSN 1999-4893; CODEN: ALGOCH), an open access journal of
computer science, theory, methods and interdisciplinary applications,
data and information systems, software engineering, artificial
intelligence, automation and control systems, is published online
quarterly by MDPI.

Journal webpage:
http://www.mdpi.com/journal/algorithms

Special issue main webpage:
http://www.mdpi.com/si/algorithms/graph_algorithms

Instructions for authors:
http://www.mdpi.com/journal/algorithms/instructions

Submission:
http://susy.mdpi.com/user/login



**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************