Abstract
In this introduction we briefly present the calculus of flownomials, a unified algebraic theory for various types of networks. This approach is the result of an effort to integrate various algebraic approaches used in computer science.
There is one thing stronger than all the armies in the world, and that is an idea whose time has come.
Victor Hugo
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag London
About this chapter
Cite this chapter
Ştefănescu, G. (2000). Brief overview of the key results. In: Network Algebra. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0479-7_1
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0479-7_1
Publisher Name: Springer, London
Print ISBN: 978-1-85233-195-5
Online ISBN: 978-1-4471-0479-7
eBook Packages: Springer Book Archive