Globally and locally minimal weight spanning tree networks

DOI10.1016/S0378-4371(01)00430-7zbMath0977.05033arXivcond-mat/0112149MaRDI QIDQ5949742

Anuraag R. Kansal, Salvatore Torquato

Publication date: 27 November 2001

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cond-mat/0112149

zbMATH Keywords

structural characteristicsbranched networks

Mathematics Subject Classification ID

Trees (05C05)

Related Items (3)

Modeling the effects of vasculature evolution on early brain tumor growth ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances ⋮ Upper and lower bounding strategies for the generalized minimum spanning tree problem

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Finding the most vital edge with respect to minimum spanning tree in weighted graphs
• Generalized spanning trees
• Percolation and minimal spanning forests in infinite graphs
• A note on genetic algorithms for degree-constrained spanning tree problems
• Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
• Invasion percolation: new algorithms and universality classes

This page was built for publication: Globally and locally minimal weight spanning tree networks