Answer by tmonteil for In graph theory, the crossing number cr(G) of a graph...
If OGDF is fast enough for your needs, since it is free software (GPL), it might be worth interfacing it with Sage. You can have a look at...
View ArticleComment by David Coudert for In graph theory, the crossing number cr(G) of a...
Indeed, we only have a slow brute force implementation. Help implementing a faster algorithm is more than welcome.
View ArticleComment by licheng for In graph theory, the crossing number cr(G) of a graph...
Thanks! Maybe it's because the program was interrupted on my computer. I recomputed it, and it took me about three hours and sagemath gives me the correct result "5". As for any improvement, it should...
View ArticleComment by licheng for In graph theory, the crossing number cr(G) of a graph...
@David Coudert A drawing D is optimal if it realizes cr(D) = cr(G). Another interesting question is, can the crossing_number or other function give an optimal drawing of G.
View ArticleComment by John Palmieri for In graph theory, the crossing number cr(G) of a...
What precisely is the question here? Comments about possible ways to improve Sage are welcome, but I don't see a question.
View ArticleComment by tmonteil for In graph theory, the crossing number cr(G) of a graph...
I guess the question is how to improve the situation (see the last sentence).
View ArticleThe function crossing_number runs too slowly?
In graph theory, the crossing number *cr(G)* of a graph *G* is the lowest number of edge crossings of a plane drawing of the graph *G*. In general, determining the crossing number of a graph is hard....
View Article
![Personal Investments • Re: 401k investments [which to choose?]](http://i.imgur.com/wA51OIw.png)
