Timeline for Maximum subgraph edge distance greater than given number
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 10, 2015 at 11:20 | answer | added | Tony Huynh | timeline score: 1 | |
| Oct 11, 2015 at 9:59 | comment | added | user1747134 | Thanks, your reply guided me to realising that what I am looking for can be easily formalised with the notion of Maximal independent set, which is dual to cliques. | |
| Oct 11, 2015 at 9:53 | answer | added | user1747134 | timeline score: 0 | |
| Oct 10, 2015 at 13:51 | comment | added | Ilya Bogdanov | Add all edges which are still absent with weoghts $>C$, and then remove the edges of weight $\leq C$. Then what you need is finding a largest clique in the resulting graph. | |
| Oct 10, 2015 at 12:38 | review | First posts | |||
| Oct 10, 2015 at 12:48 | |||||
| Oct 10, 2015 at 12:37 | history | asked | user1747134 | CC BY-SA 3.0 |