
	Where results make sense

Topic: Charles E Leiserson

	Big O notation - Wikipedia, the free encyclopedia
		Unlike most other computational problems, in graphs, there are two relevant parameters describing the size of the input, V and E; V is the number of vertices in the graph, while E is the number of edges in the graph.
		Keep in mind that the symbols V and E are never used inside asymptotic notation with their literal meaning, so there is no risk of ambiguity.
		Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein.
	en.wikipedia.org /wiki/Big_O_notation (1710 words)

	Références (Site not responding. Last check: 2007-11-01)
		Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Algorithms, MIT Press, 1990.
		Ron L. Graham, Donald E. Knuth, Oren Patashnik, Concrete mathematics: a foundation for computer science, Addison Wesley, 1989.
		Donald E. Knuth, The TeXbook, Addison Wesley, 1984.
	www.enseignement.polytechnique.fr /informatique/IF/poly/main013.html (842 words)

Try your search on: Qwika (all wikis)