Sciweavers

6740 search results - page 111 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
115
Voted
ICALP
2001
Springer
15 years 7 months ago
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
Jochen Alber, Henning Fernau, Rolf Niedermeier
110
Voted
ASIAN
1999
Springer
86views Algorithms» more  ASIAN 1999»
15 years 7 months ago
A Parallel Approximation Algorithm for the Max Cut Problem on Cubic Graphs
Tiziana Calamoneri, Irene Finocchi, Yannis Manouss...
COCOON
1999
Springer
15 years 7 months ago
On the Complexity of Approximating Colored-Graph Problems
Andrea E. F. Clementi, Pierluigi Crescenzi, Gianlu...