Path Problems in Networks

@inproceedings{Baras2010PathPI,
  title={Path Problems in Networks},
  author={John S. Baras and George Theodorakopoulos},
  booktitle={Path Problems in Networks},
  year={2010}
}
The algebraic path problem is a generalization of the shortest path problem in graphs. Various instances of this abstract problem have appeared in the literature, and similar solutions have been independently discovered and rediscovered. The repeated appearance of a problem is evidence of its relevance. This book aims to help current and future researchers add this powerful tool to their arsenal, so that they can easily identify and use it in their own work. Path problems in networks can be… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS
16 Citations
52 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 52 references

Graphs, Dioids and Semirings: New Models and Algorithms

  • M Gondran, M Minoux
  • Graphs, Dioids and Semirings: New Models and…
  • 2008

RFC 4271: A border gateway protocol

  • Y Rekhter, T Li, S Hares
  • RFC 4271: A border gateway protocol
  • 2006

Traffic Assignment and Gibbs-Maslov Semirings

  • P Lotito, E Mancinelli, J Quadrat
  • In Idempotent Mathematics and Mathematical…
  • 2003

Similar Papers

Loading similar papers…