Special Issue on Graph Algorithms

Algorithms

关键词: graph algorithms;    computational complexity;    fixed-parameter tractability;    exact algorithms;    approximation algorithms;    heuristics;    computational studies;   

DOI  :  10.3390/a6030457

来源: DOAJ

【 摘 要 】

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.

【 授权许可】

Unknown