Tagged Questions
-4
votes
0answers
35 views
Any given a complete graph, through the program calculates all of his non-isomorphic spanning subgraph [closed]
Any given a complete graph, through the program calculates all of his non-isomorphic spanning subgraph, ie write the complete figure can be calculated for all non-isomorphic subgraphs program just ...
7
votes
2answers
146 views
FindShortestTour for charity (or: How can I optimize meal delivery with FindShortestTour?)
I've been wondering about this for a while - but never got around to asking - until I saw faleichik's incredible answer to Mathematica Minecraft.
I did some work at a not-for-profit a little while ...
6
votes
2answers
228 views
2
votes
0answers
113 views
Why my Mathematica 9.0.1 wont work with some samples of Mathematica in Graph Theory?
I updated my Mathematica recently to 9.0.1 cause the previous version was giving me freaky result especially in FindMinimumCostFlow and ...
0
votes
0answers
33 views
5
votes
3answers
394 views
Travelling salesman with start and end points for 30 points
I am doing a route optimisation for delivery vehicles and failing dismally. Please see problem statement below. My current solution uses FindShortestTour, but this does not have defined start and end ...
14
votes
2answers
386 views
How can I speed up the classic GA for graph coloring?
I'm trying to compute the chromatic number of this graph (which is 28):
g = Import@"http://www.info.univ-angers.fr/pub/porumbel/graphs/dsjc250.5.col";
My genetic ...
7
votes
1answer
417 views
How to speed up Minimum Spanning Tree algorithm?
How to speed up MST algorithm? I work with graphs and I have adopted Prim's algorithm for my needs, from here.
The graphs which I use are very dense (number of vertexes: $V=500$ and every vertex is ...
7
votes
3answers
204 views
How can I efficiently check if a graph is unit distance?
A unit distance graph is a graph that is embeddable in the plane so that every edge has length 1.
...
