Editorial: Special Issue on Graph Algorithms

被引:1
|
作者
Jansson, Jesper [1 ]
机构
[1] Kyoto Univ, Inst Chem Res, Bioinformat Ctr, Lab Math Bioinformat, Uji, Kyoto 6110011, Japan
关键词
graph algorithms; computational complexity; fixed-parameter tractability; exact algorithms; approximation algorithms; heuristics; computational studies;
D O I
10.3390/a6030457
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:457 / 458
页数:2
相关论文
共 50 条