3 exercises
Tagged:
  • reduction x

Start over - to expand, or dig in by adding more tags and revising the query.

Sort By: trending ▼ date
0
Undergraduate
By John Doe on Nov. 3, 2012 | Updated Dec. 6, 2017

Direct reduction from Graph Homomorphism to SAT

The decision problem \(GraphHomo\) is defined as follows: \(GraphHomo = \{\langle G, H\rangle \mid \text{there is a graph homomorphism from G to H}\}\) Give a direct reduction from \(GraphHomo\) to …
0
Undergraduate
By Shiva Kintali on June 12, 2012 | Updated Dec. 6, 2017

Subset Sum vs Partition

Consider the following problems : Partition problem : Given a collection of \(n\) integers \(a_1, a_2, \ldots, a_n\), is there a subset \(I~\subset~{1,2, \ldots, n }\) such that …
0
Graduate
By Shiva Kintali on June 9, 2012 | Updated Dec. 6, 2017

Minimum edge cover vs Maximum matching

An edge cover of a graph \(G(V,E)\) is a subset \(F \subseteq E\) of edges such that every node is incident to at least one edge in \(F\). Show that a minimum cardinality edge cover can be determine…
Post Something
x

Select What You'd Like To Post

POST AN ARTICLE
POST AN OPEN PROBLEM
POST AN EXERCISE
POST A MULTIPLE-CHOICE QUESTION

Content Types

Social learning platform. © 2016 True Group Inc. All Right Reserved