Timeline for Embedding planar graphs into the grid
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 24, 2015 at 23:39 | answer | added | David Wood | timeline score: 3 | |
| Sep 24, 2015 at 14:54 | comment | added | Pavan Sangha | Is there a mistake in the paper? | |
| Sep 24, 2015 at 14:51 | comment | added | Pavan Sangha | Hi guys, just make sure i haven't misstated Valiant's result here is the paper where i found it stated ac.els-cdn.com/0012365X9090358O/… it's on page 4 of the document under lemma 2.1. And yes the paper i'm referring to is the one mentioned above. | |
| Sep 24, 2015 at 14:27 | comment | added | Tony Huynh | @j.c. It is likely Universality Considerations in VLSI Circuits computer.org/csdl/trans/tc/1981/02/06312176.pdf | |
| Sep 24, 2015 at 14:16 | comment | added | j.c. | Which paper are you reading? | |
| Sep 24, 2015 at 14:04 | answer | added | Tony Huynh | timeline score: 9 | |
| Sep 24, 2015 at 12:38 | answer | added | Igor Rivin | timeline score: 0 | |
| Sep 24, 2015 at 12:18 | comment | added | Louis Deaett | By some sort of continuity argument, one can always take the points of a planar embedding to be in $\mathbb Q \times \mathbb Q$, and then scale everything up so that the coordinates will all be integers. So the $O(|V|)$ bound would really seem to be the essential aspect of the result. | |
| Sep 24, 2015 at 10:43 | history | asked | Pavan Sangha | CC BY-SA 3.0 |