Graphs, Dioids and Semirings: New Models and Algorithms
来源:互联网 发布:mac是什么 编辑:程序博客网 时间:2024/06/06 07:43
The origins of Graph Theory date back to Euler (1736) with the solution of the celebrated 'Koenigsberg Bridges Problem'; and to Hamilton with the famous 'Trip around the World' game (1859), stating for the first time a problem which, in its most recent version C the 'Traveling Salesman Problem' -, is still the subject of active research. Yet, it has been during the last fifty years or sowith the rise of the electronic computersthat Graph theory has become an indispensable discipline in terms of the number and importance of its applications across the Applied Sciences. Graph theory has been especially central to Theoretical and Algorithmic Computer Science, and Automatic Control, Systems Optimization, Economy and Operations Research, Data Analysis in the Engineering Sciences. Close connections between graphs and algebraic structures have been widely used in the analysis and implementation of efficient algorithms for many problems, for example: transportation network optimization, telecommunication network optimization and planning, optimization in scheduling and production systems, etc.
The primary objectives of GRAPHS, DIOÏDS AND SEMIRINGS: New Models and Algorithms are to emphasize the deep relations existing between the semiring and dioïd structures with graphs and their combinatorial properties, while demonstrating the modeling and problem-solving capability and 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 (i.e., semirings), or correspond to a new branch of algebra (i.e., dioïds), apart from the classical structures of groups, rings, and fields.
http://rapidshare.com/files/171627263/0387754490.rar
http://depositfiles.com/files/johfd3gfi
- Graphs, Dioids and Semirings: New Models and Algorithms
- Data Mining : Concepts, Models, Methods, and Algorithms
- Python Algorithms Learning Notes(2)—Implementing Graphs and Trees
- Scenario and Attack Graphs
- Mining Graphs and Tensors
- Tensorflow Graphs and Sessions
- Object archiving and Object graphs
- Spark and SPARQL; RDF Graphs and GraphX
- Volatility and ARCH Models
- C++ Arrays and Algorithms
- Basic Structures and Algorithms
- Data Structures and Algorithms
- Data Structures and Algorithms
- Algorithms Collection and Implementation
- Mapreduce and Mobile Algorithms.
- Ideals, Varieties, and Algorithms
- Discrimination Models , Generative Models and Naive Bayes
- Chapter 4 Trees and Graphs - 4.1
- [分享]杰.德.爱华兹(中国)软件 J.D. Edwards 在零售业解决方案
- [原创]JD Edwards/AS400开发实施QQ群
- PC QUICKSTEPS 2/E
- [分享]维基百科当中关于“J.D. Edwards”的详细介绍
- Design Concepts in Programming Languages
- Graphs, Dioids and Semirings: New Models and Algorithms
- Service-Oriented Architecture (SOA) Governance for the Services Driven Enterprise
- FPGA Prototyping ByVerilog Examples
- WebLogic的初步研究
- Mastering Revit Architecture 2009
- JDBC驱动汇总
- Cache与主存地址映像【转载】
- ???!!!
- Real World Haskell