Graphs, dioids and semirings : new models and algorithms

Bibliographic Information

Graphs, dioids and semirings : new models and algorithms

Michel Gondran and Michel Minoux

(Operations research/computer science interface series, 41)

Springer, c2008

  • e

Available at  / 9 libraries

Search this Book/Journal

Note

Includes bibliographical references and index

Description and Table of Contents

Description

The primary objective of this essential text is to emphasize the deep relations existing between the semiring and dioid structures with graphs and their combinatorial properties. It does so at the same time as demonstrating the modeling and problem-solving flexibility of these structures. In addition the book provides an extensive overview of the mathematical properties employed by "nonclassical" algebraic structures which either extend usual algebra or form a new branch of it.

Table of Contents

Pre-Semirings, Semirings and Dioids.- Combinatorial Properties of (Pre)-Semirings.- Topology on Ordered Sets: Topological Dioids.- Solving Linear Systems in Dioids.- Linear Dependence and Independence in Semi-Modules and Moduloids.- Eigenvalues and Eigenvectors of Endomorphisms.- Dioids and Nonlinear Analysis.- Collected Examples of Monoids, (Pre)-Semirings and Dioids.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BA86597192
  • ISBN
    • 9780387754499
    • 9780387754505
  • Country Code
    us
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    New York
  • Pages/Volumes
    xix, 383 p.
  • Size
    25 cm
  • Classification
  • Subject Headings
  • Parent Bibliography ID
Page Top