I\'m interesting the NP-complete \"minimum bandwidth\" problem for finding the minimum bandwidth of a graph. For those not familiar, here is a link about it...
I\'m trying to solve a slightly modified version of the Hamiltonian Path problem. It is modified in that the start and end points are given to us and instead of determining whether a solution exists,
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical andcannot be reasonably answered in its current form. For help clari
here is the question. I am wondering if there is a clear and efficient proof: Vertex Cover: input undirected G, integer k > 0. Is there a 开发者_StackOverflowsubset of
We are given a set A = {a1,a2,...,an} Given subsets of A named B1,B2, ..., Bm. If a subset of A named H has intersection with all given B\'s, we call H \"Covering subset\". Is there any \"covering su
I have seen a question on 2-approximation algorithm for Vertex-Cover problem(VC, known Np-Complete problem), and i don\'t know the answer. The problem is the following : Find a 2-approximation algorit
Few days ago I was working on interval graphs to solve the known problem of resource allocation, as we know there is a greedy approach that solves this problem (chromatic number) in polynomial time an
first off I\'m going to say I don\'t know a whole lot about theory and such. But I was wondering if this was an NP or NP-complete problem. It specifically sounds like a special case of the subset sum
Let\'s say I have a large (several thousand node) directed graph G and a much smaller (3-5 node) directed graph g.I want to count how many isomorphisms of g are in G.In other words, I want to know how
\"Prove that it is NP-Complete to determine given input G and k whether G has both a clique of size k and an independent set of size k. Note that this is 1 problem, not 2; the answer is yes if and onl
加载中,请稍侯......