Timeline for Estimating Maximal-Clique of Metric Graphs via the Rank of their Adjacency Matrix
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 20, 2018 at 19:47 | comment | added | Fedor Petrov | Not surprising. It is very concrete class of graphs. | |
| Dec 20, 2018 at 19:14 | comment | added | Manfred Weis | So the NP-complete decision problem of whether a graph contains a clique larger than a given size is easy in the case of metric binary graphs; a fact I haven't seen mentioned yet. | |
| Dec 20, 2018 at 11:59 | vote | accept | Manfred Weis | ||
| Dec 20, 2018 at 10:55 | history | answered | Fedor Petrov | CC BY-SA 4.0 |