#7600: Vertex cover
----------------------------+-----------------------------------------------
Reporter: ncohen | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.3
Component: graph theory | Keywords:
Work_issues: | Author:
Upstream: N/A | Reviewer:
Merged: |
----------------------------+-----------------------------------------------
Comment(by kevin.stueve):
I've never reviewed a patch before.
We were just talking about vertex cover in my algorithms class the other
day.
The three problems:[[BR]]
1) Does G have a clique of size m or more?[[BR]]
2) Is there a vertex cover of size m or less for G?[[BR]]
3) Does G contain an independent set of size m or more?[[BR]]
are all polynomially reducible to each other.
exercise 9, p 403, The Design and Analysis of Algorithms, 2nd Edition
I'm not aware if those other problems are implemented in Sage. If not,
maybe a ticket should be created.
3048 As vertex cover is a `NP`-complete problem
IMO, would be better with the word "an" in place of "a".
Kevin Stueve
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7600#comment:3>
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.
