Trees and electrical networks

  • Martin Loebl


Given a connected graph G = (V,E) and a weight function w : E → ℚ, the minimum spanning tree problem asks for a spanning tree T = (V, F), FE, for which Σe∊F w(e) is minimal. A greedy algorithm (GA) is as follows: in the initial step we choose a cheapest edge, and in each subsequent step we choose one among the cheapest remaining edges with the restriction that the subgraph of G formed by the selected edges is acyclic.


Span Tree Greedy Algorithm Minimum Span Tree Transition Probability Matrix Electrical Network 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Vieweg+Teubner | GWV Fachverlage GmbH 2010

Authors and Affiliations

  • Martin Loebl
    • 1
  1. 1.Department of Applied Mathematics, Institut of Theoretical Computer ScienceCharles UniversityPrahaTschechische Republik

Personalised recommendations