Timeline for Graph drawing maximizing the volume of the convex hull
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 19, 2013 at 1:10 | comment | added | Joseph O'Rourke | I believe I can see how to show that minimizing the volume is NP-hard, and I suspect that maximizing is equally difficult. | |
| Mar 18, 2013 at 17:45 | comment | added | Hao Chen | @David Cohen: Yes of course. But we need to assume that an embedding exists at the first place. I mean, situation like $G=C_3$ (triangle), $\ell=3,4,10$ should not be considered. | |
| Mar 18, 2013 at 16:09 | comment | added | David Cohen | A volume maximizing embedding always exists because the space of embeddings is compact. | |
| Mar 18, 2013 at 15:59 | history | edited | Hao Chen | CC BY-SA 3.0 |
added 10 characters in body
|
| Mar 18, 2013 at 15:11 | comment | added | Bati | Use double backslashes \\{ \\} | |
| Mar 18, 2013 at 13:56 | comment | added | Hao Chen | any one tell me how to type the braket {} for a set? \{ \} doesn't work. | |
| Mar 18, 2013 at 13:56 | history | edited | Hao Chen | CC BY-SA 3.0 |
added 303 characters in body
|
| Mar 18, 2013 at 12:53 | history | asked | Hao Chen | CC BY-SA 3.0 |