Graph Theory and Its Applications, Second Edition

Capa
CRC Press, 22/09/2005 - 800 páginas
3 Resenhas
Already an international bestseller, with the release of this greatly enhanced second edition, Graph Theory and Its Applications is now an even better choice as a textbook for a variety of courses -- a textbook that will continue to serve your students as a reference for years to come.

The superior explanations, broad coverage, and abundance of illustrations and exercises that positioned this as the premier graph theory text remain, but are now augmented by a broad range of improvements. Nearly 200 pages have been added for this edition, including nine new sections and hundreds of new exercises, mostly non-routine.

What else is new?

  • New chapters on measurement and analytic graph theory
  • Supplementary exercises in each chapter - ideal for reinforcing, reviewing, and testing.
  • Solutions and hints, often illustrated with figures, to selected exercises - nearly 50 pages worth
  • Reorganization and extensive revisions in more than half of the existing chapters for smoother flow of the exposition
  • Foreshadowing - the first three chapters now preview a number of concepts, mostly via the exercises, to pique the interest of reader

    Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.
  •   

    O que estão dizendo - Escrever uma resenha

    Comentário do usuário - Sinalizar como impróprio

    ver página 607 sobre a teoria de Polya usada por Yan para enumeração de mecanismos especializados.

    Conteúdo

    Preface
    1
    STRUCTURE and REPRESENTATION
    57
    TREES
    115
    SPANNING TREES
    163
    CONNECTIVITY
    217
    OPTIMAL GRAPH TRAVERSALS
    247
    PLANARITY AND KURATOWSKIS THEOREM
    285
    DRAWING GRAPHS AND MAPS
    337
    SPECIAL DIGRAPH MODELS
    493
    NETWORK FLOWS and APPLICATIONS
    533
    GRAPHICAL ENUMERATION
    577
    ALGEBRAIC SPECIFICATION of GRAPHS
    613
    NONPLANAR LAYOUTS
    651
    APPENDIX
    681
    BIBLIOGRAPHY
    695
    SOLUTIONS and HINTS
    709

    GRAPH COLORINGS
    371
    MEASUREMENT AND MAPPINGS
    417
    ANALYTIC GRAPH THEORY
    469

    Termos e frases comuns

    Referências a este livro

    Todos os resultados da Pesquisa de Livros do Google »

    Sobre o autor (2005)

    Jonathan L. Gross is Professor of Computer Science at Columbia University. His mathematical work in topology and graph theory have earned him an Alfred P. Sloan Fellowship, an IBM Postdoctoral Fellowship, and numerous research grants. With Thomas Tucker, he wrote Topological Graph Theory and several fundamental pioneering papers on voltage graphs and on enumerative methods. He has written and edited eight books on graph theory and combinatorics, seven books on computer programming topics, and one book on cultural sociometry.

    Yellen, Applied Mathematics Department, Florida Institute of Technology, Melbourne.

    Informações bibliográficas