#14528: Additional doctests for the graph module
---------------------------------+------------------------------------------
Reporter: azi | Owner: tbd
Type: PLEASE CHANGE | Status: needs_review
Priority: major | Milestone: sage-5.10
Component: PLEASE CHANGE | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by azi):
Thanks for the comment I'll fix that.
As for the is_perfect method. The line graph of a bipartite graph is in
fact the Cartesian product of complete graphs. Hence an even faster way to
recognize them is use the Cartesian factorisation algorithm and check that
each component is a clique.
In the near future I'd really love to have the poly time algorithm for
testing perfect graphs.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14528#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.
