Le mardi 11 octobre 2016 16:03:44 UTC+2, Travis Scrimshaw a écrit :
>
>
>
>>> Even if it does turn out that this technique performs worse than Sage on
>>> some graphs, is it worth trying to integrate it as an option for users?
>>>
>>
>> Are these algorithms published? (sorry, "Mark Bell" isn't v
>
>> Even if it does turn out that this technique performs worse than Sage on
>> some graphs, is it worth trying to integrate it as an option for users?
>>
>
> Are these algorithms published? (sorry, "Mark Bell" isn't very googleable;
> e.g. I found this https://arxiv.org/a/bell_m_3.html
> but
On Tuesday, October 11, 2016 at 11:25:09 AM UTC, Mark Bell wrote:
>
> I've been working on some new algorithms for computing some properties
> (eccentricity, diameter, radius, ...) of (undirected) graphs and I'm
> looking for families to test these on.
>
> I've written a reasonable efficient C ex
