#19985: Add is_partial_cube
-------------------------------------+-------------------------------------
Reporter: jaanos | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-7.1
Component: graph theory | Resolution:
Keywords: graphs partial | Merged in:
cubes | Reviewers:
Authors: Janoš Vidali | Work issues:
Report Upstream: N/A | Commit:
Branch: | d0eaded3f7315cbe886e0b88e088f8f78dd3b380
u/jaanos/add_is_partial_cube | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by ncohen):
Hello,
> OK, bipartiteness is now only checked once, without needing to make any
copies.
Okay, cool !
> Should we perhaps mention that the algorithm is really `O(n^2 log(n))`,
only for all practical purposes it can be considered a quadratic
algorithm?
Yeah probably, though that assumption is rather 'fair'. Don't bother for
the moment. I am not done understanding the algorithm, and I will probably
add some doc eventually.
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/19985#comment:30>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
