Interfaces
Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
HSCC '09 Proceedings of the 12th International Conference on Hybrid Systems: Computation and Control
A survey on fuzzy relational equations, part I: classification and solvability
Fuzzy Optimization and Decision Making
A model of configuration languages for routing protocols
Proceedings of the 2nd ACM SIGCOMM workshop on Programmable routers for extensible services of tomorrow
Improving internet-wide routing protocols convergence with MRPC timers
Proceedings of the 5th international conference on Emerging networking experiments and technologies
A Model of Internet Routing Using Semi-modules
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
The stratified shortest-paths problem
COMSNETS'10 Proceedings of the 2nd international conference on COMmunication systems and NETworks
A formal study of trust-based routing in wireless ad hoc networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Theory and new primitives for safely connecting routing protocol instances
Proceedings of the ACM SIGCOMM 2010 conference
Long-run cost analysis by approximation of linear operators over dioids
Mathematical Structures in Computer Science
On the λ-robustness of matrices over fuzzy algebra
Discrete Applied Mathematics
Model refinement using bisimulation quotients
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Extending conceptualisation modes for generalised Formal Concept Analysis
Information Sciences: an International Journal
Optimal path: theory and models for vessel segmentation
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
On the interaction of multiple routing algorithms
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
On the O(n3) algorithm for checking the strong robustness of interval fuzzy matrices
Discrete Applied Mathematics
Skew polynomial rings, Gröbner bases and the letterplace embedding of the free associative algebra
Journal of Symbolic Computation
Fuzzy relation equations and subsystems of fuzzy transition systems
Knowledge-Based Systems
"All roads lead to Rome": optimistic recovery for distributed iterative data processing
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Dominance rules for the choquet integral in multiobjective dynamic programming
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
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 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, DIODS AND SEMIRINGS: New Models and Algorithms are to emphasize the deep relations existing between the semiring and diod 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., diods), apart from the classical structures of groups, rings, and fields.