Hi CF's .
Is there any algorithm that can find the biggest Complete graph inside a graph.
I searched a little but i didn't find any resources , is such algorithm even exist ?
Complete graph
Hi CF's .
Is there any algorithm that can find the biggest Complete graph inside a graph.
I searched a little but i didn't find any resources , is such algorithm even exist ?
| Rev. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| en1 |
|
Mr.Awesome | 2016-04-21 02:13:01 | 196 | Initial revision (published) |