|
|
Algorithms 2013
Special Issue on Graph AlgorithmsDOI: 10.3390/a6030457 Keywords: graph algorithms, computational complexity, fixed-parameter tractability, exact algorithms, approximation algorithms, heuristics, computational studies 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.
|
