You have only a chance if your huge graph has special properties - like symmetries - simplifying the task.
See also https://en.wikipedia.org/wiki/Clique_problem
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice
In reply to Re^5: Sub set where all are connected (updated)
by LanX
in thread Sub set where all are connected
by Sanjay
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |