Get Free Shipping on orders over $79
Optimization Problems in Graph Theory : In Honor of Gregory Z. Gutin's 60th Birthday - Boris Goldengorin

Optimization Problems in Graph Theory

In Honor of Gregory Z. Gutin's 60th Birthday

By: Boris Goldengorin (Editor)

eText | 27 September 2018

At a Glance

eText


$199.00

or 4 interest-free payments of $49.75 with

 or 

Instant online reading in your Booktopia eTextbook Library *

Why choose an eTextbook?

Instant Access *

Purchase and read your book immediately

Read Aloud

Listen and follow along as Bookshelf reads to you

Study Tools

Built-in study tools like highlights and more

* eTextbooks are not downloadable to your eReader or an app and can be accessed via web browsers only. You must be connected to the internet and have no technical issues with your device or browser that could prevent the eTextbook from operating.

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

on
Desktop
Tablet
Mobile

More in Production of Quality Control Management

Organizational Behavior - Robert E Stevens

eTEXT

Millennium Stocks - Richard C. Dorf

eTEXT

$174.90

Managing Big Teams - Tony Llewellyn

eBOOK

RRP $10.15

$8.99

11%
OFF