1933 search results - page 45 / 387 » Improved Algorithms for the Feedback Vertex Set Problems |
144
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
We propose the use of rough sets theory to improve the first approximation provided by a multi-objective evolutionary algorithm and retain the nondominated solutions using a new ...
134
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
A string graph is the intersection graph of a set of curves in the plane. Each curve is represented by a vertex, and an edge between two vertices means that the corresponding curv...
107
click to vote
CSR
2007
Springer
15 years 9 months ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...
119
Voted
HPCC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
122
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
We present a linear time algorithm for the minimum linear arrangement problem on proper interval graphs. The obtained ordering is a 4-approximation for general interval graphs. 1 ...