Special Issue on Graph Algorithms

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