#13280: Extend SubgraphSearch class
----------------------------+-----------------------------------------------
Reporter: vdelecroix | Owner: vdelecroix
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.3
Component: graph theory | Keywords: graph, subgraph, search,
subsets
Work issues: | Report Upstream: N/A
Reviewers: | Authors: Vincent Delecroix
Merged in: | Dependencies:
Stopgaps: |
----------------------------+-----------------------------------------------
In [http://ask.sagemath.org/question/133/subsets-with-condition ask-
sagemath.org (question 133)] one asked the following question. Given a
collection of sets how do I find a subcollection with prescribed
intersections cardinality between its members. The natural way to do this
is through a subgraph search but the current implementation does not allow
that problem to be solved.
The patch reimplement the main method of the class SubgraphSearch adding
options that allow to solve the abolve problem. An instance of the above
problem is written in the documentation of
sage.graphs.generic_graph.search_subgraph method.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13280>
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.
