In the history of adoption research, subjective norm mostly remains as the unloved child, being significant in this analysis and not significant in that analysis. Already Davis et al. had to exclude subjective norm of the Technology Acceptance Model due to theoretical and measurement problems. Overall the results of subjective norm as an antecedent for behavioral intention in IS research are qu...

The minimum vertex cover problem (MVCP) is a well-known combinatorial optimization of graph theory. MVCP an NP (nondeterministic polynomial) complete and it has exponential growing complexity with respect to the size graph. No algorithm exits till date that can exactly solve in deterministic polynomial time scale. However, several algorithms are proposed approximately short Such useful for larg...