1951 search results - page 112 / 391 » An algorithm for improving graph partitions |
127
click to vote
STACS
2004
Springer
15 years 9 months ago
2004
Springer
We present an improved average case analysis of the maximum cardinality matching problem. We show that in a bipartite or general random graph on n vertices, with high probability ...
142
click to vote
JMLR
2002
15 years 4 months ago
2002
This paper introduces the problem of combining multiple partitionings of a set of objects into a single consolidated clustering without accessing the features or algorithms that d...
177
click to vote
JCB
2002
15 years 4 months ago
2002
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
123
click to vote
IPL
2006
15 years 4 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
122
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...