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

来源：

ALGORITHMS | 2013年 / 6卷 / 03期

关键词：

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

共 9 条

[1] A Polynomial-Time Algorithm for Computing the Maximum Common Connected Edge Subgraph of Outerplanar Graphs of Bounded Degree [J].

Akutsu, Tatsuya ;

Tamura, Takeyuki .

ALGORITHMS, 2013, 6 (01) :119-135

[2] Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability [J].

Bonizzoni, Paola ;

Dondi, Riccardo ;

Pirola, Yuri .

ALGORITHMS, 2013, 6 (01) :1-11

[3] Dubins Traveling Salesman Problem with Neighborhoods: A Graph-Based Approach [J].

Isaacs, Jason T. ;

Hespanha, Joao P. .

ALGORITHMS, 2013, 6 (01) :84-99

[4] Computational Study on a PTAS for Planar Dominating Set Problem [J].

Marzban, Marjan ;

Gu, Qian-Ping .

ALGORITHMS, 2013, 6 (01) :43-59

[5] Exact Algorithms for Maximum Clique: A Computational Study [J].

Prosser, Patrick .

ALGORITHMS, 2012, 5 (04) :545-587

[6] Computing the Eccentricity Distribution of Large Graphs [J].

Takes, Frank W. ;

Kosters, Walter A. .

ALGORITHMS, 2013, 6 (01) :100-118

[7] New Heuristics for Rooted Triplet Consistency [J].

Tazehkand, Soheil Jahangiri ;

Hashemi, Seyed Naser ;

Poormohammadi, Hadi .

ALGORITHMS, 2013, 6 (03) :396-406

[8] Extracting Co-Occurrence Relations from ZDDs [J].

Toda, Takahisa .

ALGORITHMS, 2012, 5 (04) :654-667

[9] Tractabilities and Intractabilities on Geometric Intersection Graphs [J].

Uehara, Ryuhei .

ALGORITHMS, 2013, 6 (01) :60-83

← 1 →