1101 search results - page 56 / 221 » An Algorithm for the Graph Crossing Number Problem |
123
Voted
ESCAPE
2007
Springer
15 years 6 months ago
2007
Springer
In the NP-hard Cluster Editing problem, we have as input an undirected graph G and an integer k 0. The question is whether we can transform G, by inserting and deleting at most k ...
127
Voted
HICSS
2008
IEEE
15 years 9 months ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
215
Voted
ISCA
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
110
click to vote
GECCO
2000
Springer
15 years 6 months ago
2000
Springer
We propose a new Genetic Algorithm (GA) for solving the minimum span frequency assignment problem (MSFAP). The MSFAP is minimizing the range of the frequencies assigned to each tr...
159
click to vote
ALGORITHMICA
2010
15 years 25 days ago
2010
The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show tha...