Timeline for Integer linear programming (ILP) formulation of connectivity of induced subgraph
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 8, 2020 at 13:24 | answer | added | Himanshu Khandelwal | timeline score: 0 | |
| Feb 7, 2020 at 21:18 | answer | added | RobPratt | timeline score: 1 | |
| Feb 7, 2020 at 19:36 | comment | added | Manfred Weis | you can find an answer also here: mathoverflow.net/a/282317/31310 | |
| Feb 7, 2020 at 19:25 | comment | added | Manfred Weis | I had asked a similar question about two years ago: mathoverflow.net/questions/282302/… | |
| Feb 7, 2020 at 15:02 | comment | added | Himanshu Khandelwal | @RobPratt No, those vertices need not be included. But based on some other constraints I am getting all the vertices. So, to simplify I have told that people need not worry about reduced vertices and vertex set remains same. | |
| Feb 7, 2020 at 13:28 | history | edited | YCor | CC BY-SA 4.0 |
removed capitals from title, added tag
|
| Feb 7, 2020 at 13:03 | comment | added | RobPratt | Your title says induced subgraph, but your description says the same vertex set. Are vertices with label 0 and no neighbors with label 1 or 2 supposed to be included? | |
| Feb 7, 2020 at 12:10 | review | First posts | |||
| Feb 7, 2020 at 12:49 | |||||
| Feb 7, 2020 at 12:05 | history | asked | Himanshu Khandelwal | CC BY-SA 4.0 |