#14502: Improvements of hyperbolicity procedures
---------------------------------+------------------------------------------
Reporter: dcoudert | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-5.10
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: David Coudert | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Changes (by ncohen):
* status: needs_review => needs_work
Comment:
Replying to [comment:14 dcoudert]:
> Your arguments a quite unfair since it was clearly indicated that
approximation_factor and additive_gap where only used by the 'cuts' algo
and that 'cuts+' was an approx with additive constant one. So the "user"
was aware.
Yep. But the code did something different.
> I have now implemented a set of modifications to use the additive_gap
with 'cuts+' and updated documentation accordingly.
Cool. Could you also add a doctest for `algorithm="dom"` ? It looks like
there's a bug there :
{{{
sage: g = graphs.PetersenGraph() rsenGraph()
sage: hyperbolicity(g,algorithm="dom")
(0, [], 0)
}}}
I would say that the dominating set has `<4` vertices. Note that it isn't
a problem per se, but the upper bound is clearly wrong.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14502#comment:15>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
