Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Browse By

O(V+E)

This dimension groups algorithms by their time complexity, how the time an algorithm takes grows with the size of its input. Wikipedia notes that an algorithm "terminates after a finite number of steps," and how many steps it needs is exactly what time complexity measures. Browsing by time complexity keeps algorithms of a similar efficiency grouped together.

Facts
Comparison
Era of Emergence
1878 CE 1
O(V+E)
Filter Results1 entry
Sources
1. Wikipedia: Graph theory
WikipediaGraph theory, History section, term-origin sentence
Quote, Graph theory, History section, term-origin sentence
The term "graph" was introduced by James Joseph Sylvester in a paper published in 1878 in Nature, where he drew an analogy between "quantic invariants" and "co-variants" of algebra and molecular diagrams.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.