filifa
/
eulerbooks
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases 1 Wiki Activity

fix parentheses

This commit is contained in:
filifa 2025-07-20 19:29:53 -04:00
parent 923e47c83b
commit d6f896128d
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
notebooks/problem0060.ipynb
View File

@ -73,7 +73,7 @@
"id": "ab8e7abc", "id": "ab8e7abc",
"metadata": {}, "metadata": {},
"source": [ "source": [
"In the language of graph theory, the problem is to find a [5-clique](https://en.wikipedia.org/wiki/Clique_(graph_theory)) in this graph where the sum of the vertices is minimized. [The problem of finding cliques](https://en.wikipedia.org/wiki/Clique_problem) is hard (i.e. NP-complete) in general, but we can find 5-cliques in our graph in polynomial time by simply iterating through every combination of 5 vertices in the graph and seeing if those vertices form a complete subgraph.\n", "In the language of graph theory, the problem is to find a [5-clique](https://w.wiki/EoNJ) in this graph where the sum of the vertices is minimized. [The problem of finding cliques](https://en.wikipedia.org/wiki/Clique_problem) is hard (i.e. NP-complete) in general, but we can find 5-cliques in our graph in polynomial time by simply iterating through every combination of 5 vertices in the graph and seeing if those vertices form a complete subgraph.\n",
"\n", "\n",
"Alternatively, SageMath includes an algorithm for finding cliques." "Alternatively, SageMath includes an algorithm for finding cliques."
] ]