8000 patullo · GitHub Topics · GitHub
[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to content
#

patullo

Here are 27 public repositories matching this topic...

Approximation Algorithm for the NP-Complete problem of finding a vertex cover of minimum weight in a graph with weighted vertices. Guarantees an answers at most 2 times the optimal minimum weighted vertex cover

  • Updated Jan 12, 2019
  • Java

Approximation Algorithm for the NP-Complete problem of balancing job loads on machines. Does not guarantee an optimal solution, but instead, a solution is within a factor of 1.5 of the optimal solution

  • Updated Jun 22, 2017
  • Java

Greedy Algorithm to find a minimum spanning tree in an undirected graph by deleting heaviest edges unless it would disconnect the graph

tree algorithm algorithms graph edge mst < 9E81 a data-hydro-click="{"event_type":"explore.click","payload":{"click_context":"REPOSITORY_CARD","click_target":"TOPIC","click_visual_representation":"TOPIC_TAG","actor_id":null,"record_id":44510,"originating_url":"https://github.com/topics/patullo","user_id":null}}" data-hydro-click-hmac="2fb89c10652f879553489104e847a37a260692a95548ee42da2f9541af27423f" title="Topic: greedy" href="/topics/greedy" data-view-component="true" class="topic-tag topic-tag-link Link f6 mb-2">greedy minimum-spanning-trees greedy-algorithms patullo noah noah-patullo algorithm-design noahpatullo minimum-spanning-tree patulo pattullo pattulo reverse-delete reverse-delete-algorithm
  • Updated Aug 9, 2017
  • Java

Improve this page

Add a description, image, and links to the patullo topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the patullo topic, visit your repo's landing page and select "manage topics."

Learn more

0