Timeline for Efficiently drawing graph of maximum degree $3$ with at most $o(n^2)$ crossings
Current License: CC BY-SA 3.0
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 16, 2017 at 13:04 | comment | added | joro | Closely related question on MSE: math.stackexchange.com/questions/2147139/… | |
| Feb 14, 2017 at 10:54 | history | asked | joro | CC BY-SA 3.0 |