Algorithms 2013, 6(3), 457-458; doi:10.3390/a6030457
Editorial

Special Issue on Graph Algorithms

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)
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.
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
PDF Full-text Download PDF Full-Text [38 KB, uploaded 12 August 2013 16:05 CEST]

Export to BibTeX |
EndNote


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.

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