np-complete

相关标签：javascript jquery android 多少钱 iPhone

Minimum Bandwidth Problem

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...[详细]

2023-02-23 05:23 分类：问答
Algorithms to find the number of Hamiltonian paths in a graph

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,[详细]

2023-02-17 12:50 分类：问答
algorithm to check whether a given graph is subgraph of another graph [closed]

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[详细]

2023-02-16 20:47 分类：问答
Proof that Dominating Set is NP-Complete

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[详细]

2023-02-16 19:18 分类：问答
Proving NP-Completeness of a problem

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[详细]

2023-02-08 00:20 分类：问答
A 2-approximation algorithm for Vertex-Cover problem using "Spanning Tree"

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[详细]

2023-02-07 22:40 分类：问答
Is the problem of finding the chromatic number of this modified interval graph NP-Complete?

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[详细]

2023-02-05 23:35 分类：问答
Is this an NP problem?

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[详细]

2023-01-27 03:33 分类：问答
Counting Subgraph Instances

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[详细]

2023-01-26 19:42 分类：问答
Prove NP-Completeness clique + independent set graph

\"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[详细]

2023-01-24 11:49 分类：问答