Special Issue "Graph Algorithms"
A special issue of Algorithms (ISSN 1999-4893).
Deadline for manuscript submissions: closed (31 October 2012)
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
Phone: +81 (0)3 5978 5534
Interests: graph algorithms; phylogenetics; approximation algorithms; combinatorial optimization
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
Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. 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. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.
Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are refereed through a peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed Open Access quarterly journal published by MDPI.
Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 300 CHF (Swiss Francs). English correction and/or formatting fees of 250 CHF (Swiss Francs) will be charged in certain cases for those articles accepted for publication that require extensive additional formatting and/or English corrections.
- 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
Algorithms 2012, 5(4), 545-587; doi:10.3390/a5040545
Received: 11 September 2012; in revised form: 29 October 2012 / Accepted: 29 October 2012 / Published: 19 November 2012| Download PDF Full-text (1432 KB)
Algorithms 2012, 5(4), 654-667; doi:10.3390/a5040654
Received: 27 September 2012; in revised form: 4 December 2012 / Accepted: 6 December 2012 / Published: 13 December 2012| Download PDF Full-text (154 KB)
Algorithms 2013, 6(1), 1-11; doi:10.3390/a6010001
Received: 31 October 2012; in revised form: 13 December 2012 / Accepted: 18 December 2012 / Published: 27 December 2012| Download PDF Full-text (189 KB)
Algorithms 2013, 6(1), 43-59; doi:10.3390/a6010043
Received: 2 November 2012; in revised form: 10 January 2013 / Accepted: 13 January 2013 / Published: 21 January 2013| Download PDF Full-text (150 KB)
Algorithms 2013, 6(1), 60-83; doi:10.3390/a6010060
Received: 23 October 2012; in revised form: 10 January 2013 / Accepted: 14 January 2013 / Published: 25 January 2013| Download PDF Full-text (193 KB)
Algorithms 2013, 6(1), 84-99; doi:10.3390/a6010084
Received: 31 October 2012; in revised form: 17 January 2013 / Accepted: 18 January 2013 / Published: 4 February 2013| Download PDF Full-text (3056 KB)
Algorithms 2013, 6(1), 100-118; doi:10.3390/a6010100
Received: 1 November 2012; in revised form: 24 January 2013 / Accepted: 31 January 2013 / Published: 18 February 2013| Download PDF Full-text (450 KB)
Article: A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree
Algorithms 2013, 6(1), 119-135; doi:10.3390/a6010119
Received: 30 October 2012; in revised form: 27 January 2013 / Accepted: 7 February 2013 / Published: 18 February 2013| Download PDF Full-text (200 KB)
Algorithms 2013, 6(3), 396-406; doi:10.3390/a6030396
Received: 14 April 2013; in revised form: 26 June 2013 / Accepted: 26 June 2013 / Published: 11 July 2013| Download PDF Full-text (222 KB)
Editorial: Special Issue on Graph Algorithms
Algorithms 2013, 6(3), 457-458; doi:10.3390/a6030457
Received: 9 August 2013; in revised form: 9 August 2013 / Accepted: 9 August 2013 / Published: 12 August 2013| Download PDF Full-text (38 KB)
Last update: 5 August 2013