1101 search results - page 173 / 221 » An Algorithm for the Graph Crossing Number Problem |
103
click to vote
CPM
2001
Springer
15 years 6 months ago
2001
Springer
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
117
click to vote
CCCG
2009
15 years 3 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
110
click to vote
GLOBECOM
2008
IEEE
15 years 3 months ago
2008
IEEE
—Conflict free spectrum allocation for secondary users in cognitive networks is a challenging problem, since the accessible spectrum is shared among users. The problem becomes to...
139
click to vote
SODA
2003
ACM
15 years 3 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
117
click to vote
SAC
2008
ACM
15 years 1 months ago
2008
ACM
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...