Open AccessThis article is
- freely available
Algorithms 2013, 6(3), 457-458; doi:10.3390/a6030457
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 article belongs to the Special Issue Graph Algorithms)
Download PDF Full-Text [38 KB, uploaded 12 August 2013 16:05 CEST]
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.
Keywords: graph algorithms; computational complexity; fixed-parameter tractability; exact algorithms; approximation algorithms; heuristics; computational studies
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
MDPI and ACS Style
Jansson, J. Special Issue on Graph Algorithms. Algorithms 2013, 6, 457-458.AMA Style
Jansson J. Special Issue on Graph Algorithms. Algorithms. 2013; 6(3):457-458.Chicago/Turabian Style
Jansson, Jesper. 2013. "Special Issue on Graph Algorithms." Algorithms 6, no. 3: 457-458.