#13073: recognition of weakly chordal graphs
--------------------------------------------------+-------------------------
Reporter: eisermbi | Owner: jason,
ncohen, rlm
Type: enhancement | Status:
needs_review
Priority: major | Milestone: sage-5.1
Component: graph theory | Resolution:
Keywords: weakly chordal, hole, antihole | Work issues:
Report Upstream: N/A | Reviewers: Nathann
Cohen
Authors: Birk Eisermann | Merged in:
Dependencies: | Stopgaps:
--------------------------------------------------+-------------------------
Comment (by ncohen):
(just for the joke) `:-PPP`
{{{
sage: g = graphs.RandomTree(400)
sage: %time g.is_weakly_chordal()
CPU times: user 9.42 s, sys: 0.02 s, total: 9.44 s
Wall time: 9.48 s
True
}}}
Yeahhhhhhhhhhh !! That's efficiency baby ! `:-D`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13073#comment:12>
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.
