Open AccessThis article is
- freely available
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 / Revised: 9 August 2013 / Accepted: 9 August 2013 / Published: 12 August 2013
Abstract 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.
This is an open access article distributed under the
Creative Commons Attribution License which permits unrestricted use, distribution,
and reproduction in any medium, provided the original work is properly cited.
Share & Cite This Article
MDPI and ACS Style
Jansson, J. Special Issue on Graph Algorithms. Algorithms 2013, 6, 457-458.
View more citation formats
Jansson J. Special Issue on Graph Algorithms. Algorithms. 2013; 6(3):457-458.
Jansson, Jesper. 2013. "Special Issue on Graph Algorithms." Algorithms 6, no. 3: 457-458.
Notes: Multiple requests from the same IP address are counted as one view.
For more information on the journal, click here
[Return to top]