Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Graph theory
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Covering problems === [[Covering problem]]s in graphs may refer to various [[Set cover problem| set cover problems]] on subsets of vertices/subgraphs. * [[Dominating set]] problem is the special case of set cover problem where sets are the closed [[Neighbourhood (graph theory)|neighborhoods]]. * [[Vertex cover problem]] is the special case of set cover problem where sets to cover are every edges. * The original set cover problem, also called hitting set, can be described as a vertex cover in a hypergraph.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)