Sciweavers

JDA
2006
59views more  JDA 2006»
13 years 11 months ago
A note on the complexity of minimum dominating set
The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial (2n) algorithm which enumerates and checks all the subsets of
Fabrizio Grandoni
DELTA
2006
IEEE
14 years 2 months ago
Modified Montgomery Modular Multiplication Using 4: 2 Compressor and CSA Adder
The efficiency of the Public Key encryption systems like RSA and ECC can be improved with the adoption of a faster multiplication scheme. In this paper, Modified Montgomery multip...
Himanshu Thapliyal, Anvesh Ramasahayam, Vivek Redd...
ESA
1994
Springer
139views Algorithms» more  ESA 1994»
14 years 3 months ago
A Simple Min Cut Algorithm
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
Mechthild Stoer, Frank Wagner