Jump to content

Dear members, finally, we decided to refresh our theme. Decision was brought based on multiple factors, primarily because of technical needs as old one is not compatible with a new platform version, but also because you all asked for a darker theme.
Here you go!

Please head here if you want to vote https://www.elite7hackers.net/topic/411861-the-new-theme/


This site uses cookies! Learn More

This site uses cookies!

For providing our services, we do use cookies.
But get used, this is what most of modern web do!
However we have to warn you since we are obligated to so due to EU laws.

By continuing to use this site, you agree to allow us to store cookies on your computer. :)
And no, we will not eat your computer nor you will be able to eat those cookies :P

Sign in to follow this  

Optimization Problems in Graph Theory In Honor of Gregory Z. Gutin's 60th Birthday

Recommended Posts

Boris Goldengorin, "Optimization Problems in Graph Theory: In Honor of Gregory Z. Gutin's 60th Birthday"
English | ISBN: 3319948296 | 2019 | 352 pages | PDF, EPUB | 29 MB

This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin's fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: * Algorithmic aspects of problems with disjoint cycles in graphs * Graphs where maximal cliques and stable sets intersect * The maximum independent set problem with special classes * A general technique for heuristic algorithms for optimization problems * The network design problem with cut constraints * Algorithms for computing the frustration index of a signed graph * A heuristic approach for studying the patrol problem on a graph * Minimum possible sum and product of the proper connection number * Structural and algorithmic results on branchings in digraphs * Improved upper bounds for Korkel-Ghosh benchmark SPLP instances

Buy Premium From My Links To Get Resumable Support,Max Speed & Support Me
[b]Download (Uploadgig)[/b]
Download ( Rapidgator )
Download ( NitroFlare )

Share this post

Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now
Sign in to follow this  

Elite7Hackers Netwok

Hack the imagination!

Support and inquiries

Open support ticket here or email us at [email protected]


Highlighted/recommended lights


Important Information

By using this site, you agree to our Privacy Policy and Terms of Use.