#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:
--------------------------------------------------+-------------------------
Changes (by ncohen):
* status: needs_work => needs_review
Comment:
Hmmm.... Well, here's how long it takes to check that random graphs are
not chordal :
{{{
sage: g = graphs.RandomGNP(200,.2)
sage: %time g.is_chordal()
CPU times: user 0.31 s, sys: 0.00 s, total: 0.31 s
Wall time: 0.31 s
False
}}}
That's not negligible at all compared to the runtime of your
is_weakly_chordal function for random graphs. What do you think we should
do ?
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13073#comment:9>
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.
