Connecting the world efficiently

DOI10.47234/MM.8007MaRDI QIDQ6653770zbMATH OpenFDO

Authors A. P. Figueroa, Julián Fresán-Figueroa

Publication date 17 December 2024

Published in Miscelánea Matemática (Search for Journal in Brave)

Full work available at URL https://doi.org/10.47234/MM.8007

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35)

Cites work

• Comparison of algorithms for the degree constrained minimum spanning tree
• Efficient graph-based image segmentation
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Otakar Borůvka on minimum spanning tree problem. Translation of both the 1926 papers, comments, history
• Über ein Minimalproblem.

This page was built for publication: Connecting the world efficiently

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