Balanced Partition of Minimum Spanning Trees

DOI10.1007/3-540-47789-6_3zbMath1049.68706OpenAlexW1494672707MaRDI QIDQ4739324

Giri Narasimhan, Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos

Publication date: 12 August 2004

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-47789-6_3

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (1)

Partitioning a graph into balanced connected classes: formulations, separation and experiments

This page was built for publication: Balanced Partition of Minimum Spanning Trees