𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One

✍ Scribed by Markus Bläser; Bodo Manthey

Publisher
Springer
Year
2005
Tongue
English
Weight
312 KB
Volume
42
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heavy cycles and spanning trees with few
Heavy cycles and spanning trees with few leaves in weighted graphs
✍ Binlong Li; Shenggui Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Let G be a 2-connected weighted graph and k ≥ 2 an integer. In this note we prove that if the sum of the weighted degrees of every k + 1 pairwise nonadjacent vertices is at least m, then G contains either a cycle of weight at least 2m/(k + 1) or a spanning tree with no more than k leaves.

An algorithm of propagation in weighted
An algorithm of propagation in weighted directed graphs with applications to economics and finance
✍ Mario Eboli 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

This paper puts forward an algorithm that computes the diffusion of events and actions across networks of economic agents, an algorithm that is applicable when such networks can be represented as weighted directed graphs. The functioning of the algorithm is shown in three applications. First, the al