Computational Complexity: a connect....

Tour Communities Teachers Enterprises

Help

Learning Communities > computer algorithms > Computational Complexity flashcards

Flashcard (Front and Back)

Front (Question)

Computational Complexity: a connected graph contains an Eulerian cycle if and only if _____

Back (Answer)

if every vertex has an even degree. If exactly 2 vertices have an odd degree, it contains an Eulerian path but not a Eulerian cycle

Memory Work Out Sessions use brain research to accelerate and improve memorization. Automatically scheduled daily review drills ensure sure you don't forget.

or Find more than 100,000 other things to learn

Educators and Trainers:

Tour YoYoBrain's resources for learning and teaching

Previous Card

See the whole card set

Next Card

Current rating: 0.0/5
1
2
3
4
5

rated by 0 users

Comments:

Other flashcards from Computational Complexity
Computational Complexity: degree of ... Computational Complexity: a connecte... Computational Complexity: Eulerian path Computational Complexity: Eulerian c... Computational Complexity: Hamiltonia...