Connecting the world efficiently
From MaRDI portal
Publication:6653770
DOI10.47234/mm.8007MaRDI QIDQ6653770
Julián Fresán-Figueroa, Ana Paulina Figueroa
Publication date: 17 December 2024
Published in: Miscelánea Matemática (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Über ein Minimalproblem.
- Efficient graph-based image segmentation
- Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
- Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history
- Comparison of algorithms for the degree constrained minimum spanning tree
This page was built for publication: Connecting the world efficiently