464 search results - page 1 / 93 » Finding the smallest image of a set |
79
Voted
ISSAC
2004
Springer
15 years 4 months ago
2004
Springer
We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering t...
SWAT
1990
Springer
15 years 2 months ago
1990
Springer
We give improved solutions for the problem of generating the k smallest spanning trees in a graph and in the plane. Our algorithm for general graphs takes time O(m log (m, n) + k2...
87
Voted
ARSCOM
1999
14 years 10 months ago
1999
A critical set in a latin square is a set of entries in a latin square which can be embedded in only one latin square. Also, if any element of the critical set is deleted, the rema...
92
Voted
COCOA
2008
Springer
15 years 20 days ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
86
Voted
ARSCOM
2008
14 years 11 months ago
2008
A Greedy Defining Set is a set of entries in a Latin square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succee...