The global theory of paths in networks. I: Definitions, examples and limits

DOI10.1016/0196-8858(81)90047-6zbMath0491.90088OpenAlexW2043081240MaRDI QIDQ1167670

Lawrence H. Harper, Xavier Berenguer

Publication date: 1981

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(81)90047-6

zbMATH Keywords

categorical approachminimum path problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs, diagram schemes, precategories (18A10)

Related Items (2)

Morphisms for resistive electrical networks ⋮ A natural notion of morphism for linear programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The global theory of flows in networks
• A solution of the Sperner-Erdős problem
• Optimal numberings and isoperimetric problems on graphs
• A necessary condition on minimal cube numberings
• Optimal Assignments of Numbers to Vertices

This page was built for publication: The global theory of paths in networks. I: Definitions, examples and limits