SPANNING TREE RESULTS FOR GRAPHS AND MULTIGRAPHS

SPANNING TREE RESULTS FOR GRAPHS AND MULTIGRAPHS

Spanning Tree Results for Graphs and Multigraphs

CHARLES L SUFFEL / CHARLES L SUFFEL & DANI JOHN T SACCOMAN / DANIEL J GROSS / John T Saccoman

102,35 €
IVA incluido
Disponible
Editorial:
World Scientific Publishing Co Pte Ltd
Año de edición:
2014
ISBN:
9789814566032
102,35 €
IVA incluido
Disponible
Añadir a favoritos
Sobre IBD

This book is concerned with the optimization problem of maximizing the number of spanning trees of a multigraph. Since a spanning tree is a minimally connected subgraph, graphs and multigraphs having more of these are, in some sense, immune to disconnection by edge failure. We employ a matrix-theoretic approach to the calculation of the number of spanning trees.The authors envision this as a research aid that is of particular interest to graduate students or advanced undergraduate students and researchers in the area of network reliability theory. This would encompass graph theorists of all stripes, including mathematicians, computer scientists, electrical and computer engineers, and operations researchers.Errata(s)

Artículos relacionados

  • INTRODUCTION TO LINEAR OPTIMIZATION
    ARKADI NEMIROVSKI
    The book presents a graduate level, rigorous, and self-contained introduction to linear optimization (LO), the presented topics beingexpressive abilities of LO;geometry of LO - structure of polyhedral sets, LO duality and its applications;traditional LO algorithms - primal and dual simplex methods, and network simplex method;polynomial time solvability of LO via ellipsoid algor...
    Disponible

    202,21 €

  • INTRODUCTION TO LINEAR OPTIMIZATION
    ARKADI NEMIROVSKI
    The book presents a graduate level, rigorous, and self-contained introduction to linear optimization (LO), the presented topics beingexpressive abilities of LO;geometry of LO - structure of polyhedral sets, LO duality and its applications;traditional LO algorithms - primal and dual simplex methods, and network simplex method;polynomial time solvability of LO via ellipsoid algor...
    Disponible

    92,89 €

  • A Gentle Introduction to Optimization
    B. Guenin / BGuenin / J. Könemann / JKönemann / L. Tunçel / LTunçel
    ...
    Disponible

    125,06 €

  • OPTIMIZATION THEORY
    JIONGMIN YONG
    Mathematically, most of the interesting optimization problems can be formulated to optimize some objective function, subject to some equality and/or inequality constraints. This book introduces some classical and basic results of optimization theory, including nonlinear programming with Lagrange multiplier method, the Karush–Kuhn–Tucker method, Fritz John's method, problems...
    Disponible

    93,52 €

  • DIFFERENTIAL GAMES
    JIONGMIN YONG
     This book uses a small volume to present the most basic results for deterministic two-person differential games. The presentation begins with optimization of a single function, followed by a basic theory for two-person games. For dynamic situations, the author first recalls control theory which is treated as single-person differential games. Then a systematic theory of two-per...
    Disponible

    129,91 €

  • INTRO COMPUTATION MATH (2ND ED)
    XIN-SHE YANG
     This unique book provides a comprehensive introduction to computational mathematics, which forms an essential part of contemporary numerical algorithms, scientific computing and optimization. It uses a theorem-free approach with just the right balance between mathematics and numerical algorithms. This edition covers all major topics in computational mathematics with a wide ran...
    Disponible

    78,36 €