Sale!

Extreme tasks of the theory of graphs and the Internet. Textbook: Andrey Raigorodsky

Original price was: $14.00.Current price is: $7.00.

& Free Shipping

Lectures are devoted to some modern, closely related sections of the theory of counts and hypergrafs. A special emphasis is on extreme tasks that arise in these sections. Serious attention is paid to the algorithmic aspect. Many topics have applications to Internet research.

Guaranteed Safe Checkout

Lectures are devoted to some modern, closely related sections of the theory of counts and hypergrafs. A special emphasis is on extreme tasks that arise in these sections. Serious attention is paid to the algorithmic aspect. Many topics have applications to Internet research.
The brochure describes both the classic tasks of the extreme theory of graphs and the latest developments in the region. It is also told about the very recent achievements, first stated in Russian -speaking literature. Among them are the Ramseeval algorithms, indicating an unexpected and fruitful connection between the classical theory of Ramsey and the tasks of finding such “difficult” extreme characteristics of the count, such as the size of the greatest clique. Among them are algorithms that work effectively on random columns. Among them, finally, the Internet modeling as a count.
The book is designed for everyone who is interested in modern applications of mathematics in the field of data analysis. She will be useful to students …

 

Author
Raigorodsky Andrey Mikhailovich
Artist
Birichev S. Yu.
Publisher
ID Intellect, 2012
Genre
Informatics, applied mathematics. Computational mathematics

 

Reviews

There are no reviews yet.

Be the first to review “Extreme tasks of the theory of graphs and the Internet. Textbook: Andrey Raigorodsky”
Shopping Cart