Tag: igraph

Finding largest cliques (completely connected sub-graph components) is hard. The best algorithms have run times proportional to 3^(#nodes/3). Triple the nodes = nine times the run length. So what’s a guy without a supercomputer to do but start looking for shortcuts? Shortcut 1: Maximize for your goals My interest is in characterizing a network, in…