Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Algorithms > NP Complete Problems > Flashcards

NP Complete Problems Flashcards

Exam 3

1
Q

What is Complete Graph

A

Complete graph are well connected and if there are n vertices (|V| = n, then |E| = n(n-1)/2

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q
A
How well did you know this?
1
Not at all
2
3
4
5
Perfectly

Algorithms (14 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2025 Bold Learning Solutions. Terms and Conditions