Timeline for Mathematica package to calculate the graph crossing number
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 17, 2019 at 17:43 | comment | added | Szabolcs | I'd love to see this implemented in M: ls11-www.cs.tu-dortmund.de/people/chimani/files/… If anyone succeeds, please contact me. | |
| Jan 17, 2019 at 17:39 | comment | added | Szabolcs | For such hard problems, the most fruitful approach is often to map them into integer programming. There are multiple papers on how to do this for crossing numbers and Mathematica already has a good ILP solver. Have you looked into this? (BTW the same approach worked very well for graph colouring—map it into SAT and solve using Mathematica. Did you get my MathWorld feedback email on this?) | |
| Jan 17, 2019 at 17:33 | history | answered | Eric W | CC BY-SA 4.0 |