Revision as of 16:14, 15 August 2020 edit Charmk (talk \| contribs) Extended confirmed users 6,013 edits No edit summary ← Previous edit		Revision as of 16:20, 15 August 2020 edit undo Charmk (talk \| contribs) Extended confirmed users 6,013 edits No edit summary Next edit →
Line 4: ==Pseudocode== The LASCNN algorithm establishes k hop neighbor list and a duplicate free pair wise connection list based on k hop information. If the neighbors are stay connected then the node is non critical <ref>G. Sugithaetal., International Journal of Advanced Engineering Technology E-ISSN 0976-3945</ref> <pre>

LASCNN algorithm: Difference between revisions