Lecture 6 - Hamiltonian Cycle Flashcards by michal wozniak | Brainscape

Q

Is Hamiltonian Cycle Np-Compllete?

A

yes

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

what is a problem instance?

A

a problem with specific parameters

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is a problem?

A

a situation that has to be solved with inifinitely many parameters

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Is hamiltonian a decision problem?

A

yes

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is a decision problem?

A

a problem with a ‘yes’ or ‘no’ answer

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

What is the hamiltonian cycle problem?

A

does a graph G contain a cycle that visits each vertex exactly once?

How well did you know this?

1

Not at all

2

3

4

5

Perfectly