Question

Graph Theory: Find optimal subgraph that contains a certain node and a fixed number of nodes

score 276 · Answer 1 · 2015-07-27 09:05:29

276

Views

Graph Theory: Find optimal subgraph that contains a certain node and a fixed number of nodes

Published on 27 Jul 2015 - 9:05

score 525 · Answer 2 · 2015-07-31 20:13:38

525

Views

2HP - Edge Disjoint Hamilton Paths

Published on 31 Jul 2015 - 20:13

score 195 · Answer 3 · 2015-08-04 12:44:04

195

Views

Prove $K_4-Cover$ is NP-Complete

Published on 04 Aug 2015 - 12:44

score 1.4k · Answer 4 · 2015-08-04 19:31:33

1.4k

Views

Why is it that if one NP complete problem is solved, all NP problems are solved?

Published on 04 Aug 2015 - 19:31

score 52 · Answer 5 · 2015-08-09 23:05:26

52

Views

Is cubic graph decomposition into claws NP-complete?

Published on 09 Aug 2015 - 23:05

score 2.8k · Answer 6 · 2015-08-16 14:15:55

2.8k

Views

NP-complete proof of subset with sum zero

Published on 16 Aug 2015 - 14:15

score 2.8k · Answer 7 · 2015-08-19 06:05:09

2.8k

Views

Coin Change Problem with Fixed Coins

Published on 19 Aug 2015 - 6:05

score 119 · Answer 8 · 2015-08-20 02:32:34

119

Views

Are there any "proof schemes" for P $\neq$ NP?

Published on 20 Aug 2015 - 2:32

score 214 · Answer 9 · 2026-03-26 13:01:51

214

Views

Can CNF Hamiltonian graphs be turned to "DNF" graphs?

Published on 26 Mar 2026 - 13:01

score 955 · Answer 10 · 2026-03-25 15:54:40

955

Views

Arranging a set of strings to form a palindrome: NP complete?

Published on 25 Mar 2026 - 15:54

score 43 · Answer 11 · 2015-09-09 15:13:59

43

Views

How problems in NP and their reductions to one another relate to $\leq_m$(many-one) languages reduction in Theory Of Computation?

Published on 09 Sep 2015 - 15:13

score 552 · Answer 12 · 2015-09-23 10:34:36

552

Views

DAG to $3$ CNF SAT

Published on 23 Sep 2015 - 10:34

score 4.5k · Answer 13 · 2015-10-04 22:16:06

4.5k

Views

Trouble understanding why Disjunctive Normal Form is polynomial time solvable but not CNF.

Published on 04 Oct 2015 - 22:16

score 1.5k · Answer 14 · 2015-10-09 20:31:27

1.5k

Views

If P = NP, would that mean P=NP-Complete?

Published on 09 Oct 2015 - 20:31

score 63 · Answer 15 · 2026-03-03 22:17:49

63

Views

Is this projection optimization problem NP-hard?

Published on 03 Mar 2026 - 22:17

List Question

Graph Theory: Find optimal subgraph that contains a certain node and a fixed number of nodes

2HP - Edge Disjoint Hamilton Paths

Prove $K_4-Cover$ is NP-Complete

Why is it that if one NP complete problem is solved, all NP problems are solved?

Is cubic graph decomposition into claws NP-complete?

NP-complete proof of subset with sum zero

Coin Change Problem with Fixed Coins

Are there any "proof schemes" for P $\neq$ NP?

Can CNF Hamiltonian graphs be turned to "DNF" graphs?

Arranging a set of strings to form a palindrome: NP complete?

How problems in NP and their reductions to one another relate to $\leq_m$(many-one) languages reduction in Theory Of Computation?

DAG to $3$ CNF SAT

Trouble understanding why Disjunctive Normal Form is polynomial time solvable but not CNF.

If P = NP, would that mean P=NP-Complete?

Is this projection optimization problem NP-hard?

Trending Questions

Popular # Hahtags

Popular Questions