Existence of shortest directed networks in R^ 2

DOI10.2140/PJM.1995.167.201MaRDI QIDQ1893293zbMATH OpenOpenAlexFDO

Authors M. 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

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

Recommendations

• On the existence of shortest directed networks
• On the existence of shortest networks in Banach spaces
• Shortest directed networks in the plane
• scientific article; zbMATH DE number 5052313
• Determining shortest networks in the Euclidean plane
• The shortest network under a given topology
• scientific article; zbMATH DE number 1559433
• Shortest paths in simply connected regions in \({\mathbb{R}}^ 2\)
• scientific article; zbMATH DE number 1163728
• scientific article; zbMATH DE number 176576

Cited in

(5)

• Shortest directed networks in the plane
• On the existence of shortest directed networks
• Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane
• Optimal connection problem of single source multiple sinks on directed networks
• On the existence of shortest networks in Banach spaces

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893293)