Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Connecting the world efficiently

From MaRDI portal
Publication:6653770
Jump to:navigation, search

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)





Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6653770&oldid=40231072"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 13 February 2025, at 21:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki