The solution to this problem: for an undirected graph g = (V, E) find a subset V′⊆V of minimum size such that every edge in E has at least one of its endpoints in V′.
-
Notifications
You must be signed in to change notification settings - Fork 0
Spyros-DC/capstoneq25
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published