#11735: Bug in is_chordal
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: tbd
Type: defect | Status: new
Priority: major | Milestone: sage-4.7.2
Component: PLEASE CHANGE | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author: Nathann Cohen
Merged: | Dependencies:
-----------------------------+----------------------------------------------
As reported by Jon on sage-devel [1], the current implementation of
is_chordal is incorrect. Given a vertex v adjacent to x and y (x and y
being non-adjacent), a shortest path between x and y in G-v does not
necessarily avoid the neighbors of v. Clearly.
Well, with this patch the shortest path is computed in the graph G with v
and all its neighbors removed with the exception of x and y, so that it
can not happen again.
Besides, as it is almost free to check that the certificate is indeed a
hole, this patch adds a test just in case `:-)`
Nathann
[1] https://groups.google.com/d/topic/sage-support/rU1VTz1Ou_I/discussion
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11735>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
