Existence of shortest directed networks in \(\mathbb{R}^ 2\)

DOI10.2140/PJM.1995.167.201zbMath0821.05030OpenAlexW2069592661MaRDI QIDQ1893293

Manuel Alfaro

Publication date: 3 July 1995

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1995.167.201

zbMATH Keywords

cyclesnumber of nodesstarting pointsboundingminimal networksending pointsshortest directed network

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Other problems of combinatorial convexity (52A37) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane ⋮ Shortest directed networks in the plane

This page was built for publication: Existence of shortest directed networks in \(\mathbb{R}^ 2\)