Sciweavers

CATS
1998
13 years 6 months ago
Finding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3
Let G(V, E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S o...
Weifa Liang, George Havas
CATS
1998
13 years 6 months ago
On Quadratic Polynomials for the Number Field Sieve
Brian Murphy, Richard P. Brent