12015 search results - page 461 / 2403 » Interactive Algorithms 2005 |
131
click to vote
COCOON
2005
Springer
15 years 10 months ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
137
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
A square is the concatenation of two identical non-empty strings. Let S be the input string which is given character by character. Let m be the (unknown) smallest integer such that...
125
click to vote
CSCLP
2005
Springer
15 years 10 months ago
2005
Springer
We discuss four variants of the graph colouring problem, and present algorithms for solving them. The problems are k-Colourability, Max Ind k-COL, Max Val k-COL, and, finally, Max...
119
click to vote
EVOW
2005
Springer
15 years 10 months ago
2005
Springer
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constra...
122
click to vote
FCT
2005
Springer
15 years 10 months ago
2005
Springer
We present an algorithm which calculates a minimum cut and its weight in an undirected graph with nonnegative real edge weights, n vertices and m edges, in time O( ` max (log n, mi...