LASCNN algorithm

In graph theory, LASCNN is a Localized Algorithm for Segregation of Critical/Non-critical Nodes[1] The algorithm works on the principle of distinguishing between critical and non-critical nodes for network connectivity based on limited topology information.

[2] The algorithm finds the critical nodes with partial information within a few hops.

[4] The performance of LASCNN is scalable and quite competitive compared to other schemes.

[5] The LASCNN algorithm establishes a k-hop neighbor list and a duplicate free pair wise connection list based on k-hop information.

[6][7] The Critical Nodes application is a Free Open-Source implementation for the LASCNN algorithm.