GraphsOptim.jl

GraphsOptim.jl copied to clipboard

**Polynomial problems** - [x] shortest path - [x] flow - [ ] assignment / matching - [ ] spanning tree **NP-hard problems** - [ ] coloring - [ ] fractional...

gdalle

Near term usage? Registering the package?

4

What is the advice for near term users of this and the flows and matching packages? Especially in the context of developers. I am comfortable with dealing with deprecations and...

Krastanov

added optimal_coloring

8

Use PicoSAT to find the optimal proper coloring of a graph.

dstahlke

Compare with networkx

2

It would be fairly easy to test our algorithms by comparing their output with the networkx equivalent

gdalle

Optimal proper coloring, chromatic number, fractional chromatic number

2

Would you be open to a pull request implementing an algorithm for chromatic number and another for fractional chromatic number? The former uses PicoSAT and the latter would use some...

dstahlke

Isomorphism

1

A natural addition is a function to find isomorphisms between graphs. I've written some code that does that. (I'm sure it works for simple graphs and simple digraphs. Not sure...

scheinerman