Abstract
Six degrees of separation!
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
The first instance of such a model is usually attributed to Euler.
- 3.
Note that there may be applications where the flow out of the source is to be maximized without regards to the flow in.
- 4.
The theoretically-minded reader will research “total unimodularity.”
- 5.
Bipartite means that there will never be any arcs between the top nodes or between the bottom nodes. You will see in the next section a more general problem.
- 6.
If the reader reads American; a billion if English.
- 7.
Note that if we can solve the longest path, we can solve the Hamiltonian path. Also, recall that linear programs can be solved in polynomial time. Ergo, if we can solve the longest path problem via LP, we prove P = NP. Then, we collect one million dollars from the Clay Mathematics Institute.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Serge Kruk
About this chapter
Cite this chapter
Kruk, S. (2018). Linear Network Models. In: Practical Python AI Projects. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-3423-5_4
Download citation
DOI: https://doi.org/10.1007/978-1-4842-3423-5_4
Published:
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-3422-8
Online ISBN: 978-1-4842-3423-5
eBook Packages: Professional and Applied ComputingApress Access BooksProfessional and Applied Computing (R0)