#16362: Orthogonal Polar Graph
-------------------------------------+-------------------------------------
Reporter: ncohen | Owner:
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-6.3
Component: graph theory | Resolution:
Keywords: | Merged in:
Authors: Nathann Cohen | Reviewers: Dima Pasechnik
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/ticket/16362 | ff7d3387b4436411ed6785e2a3b6c5c37f2ca1f6
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dimpase):
Replying to [comment:57 ncohen]:
> > Useless? You would hate to be able to work with polar graphs on 10000
vertices?
>
> By the way : I solve domination problems on those graphs.
Are the best known solutions independent sets? There are bounds on the
latter I should know a lot about...
--
Ticket URL: <http://trac.sagemath.org/ticket/16362#comment:58>
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.
For more options, visit https://groups.google.com/d/optout.
