✦ LIBER ✦

Domination in graphs with bounded propagation: algorithms, formulations and hardness results

✍ Scribed by Ashkan Aazami

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 733 KB
Volume: 19
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-008-9176-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Algorithms and Complexity Resul

Improved Algorithms and Complexity Results for Power Domination in Graphs

✍ Jiong Guo; Rolf Niedermeier; Daniel Raible 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 495 KB

A parity domination problem in graphs wi

A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs

✍ Elisabeth Gassner; Johannes Hatzl 📂 Article 📅 2008 🏛 Springer Vienna 🌐 English ⚖ 268 KB

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

A grid-enabled distributed branch-and-bo

A grid-enabled distributed branch-and-bound algorithm with application on the Steiner Problem in graphs

✍ Lúcia M.A. Drummond; Eduardo Uchoa; Alexandre D. Gonçalves; Juliana M.N. Silva; 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 201 KB

This work introduces a distributed branch-and-bound algorithm to be run on computational Grids. Grids are often organized in a hierarchical fashion: clusters of processors connected via high-speed links, while the clusters themselves are geographically distant and connected through slower links. Our