On Single Source Reachability Improvement
The problem of augmenting a given network, or graph, via edge-additions for improved reachability from a given source node is considered. We formulate and study the following Single Source Reachability Improvement problem (SSRI): given a graph G = (II, E), with a special (source) vertex s and two no...
Saved in:
| Main Author: | Alkak, Hashem (author) |
|---|---|
| Format: | masterThesis |
| Published: |
2022
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10725/15097 https://doi.org/10.26756/th.2023.598 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Similar Items
-
An Adapted Load-Balancing implementation for Sharded Blockchains
by: Daou, David Halim
Published: (2024) -
SDODV. (c2018)
by: Assi, Maram
Published: (2018) -
Detecting attacks in a cluster based QOS-OLSR protocol. (c2014)
by: Sanadiki, Hiba
Published: (2014) -
IEEE 802.11 wireless mesh network. (c2008)
by: Khabbaz, Maurice
Published: (2008) -
A low degree vertex elimination with high degree vertex selection heuristic for strongly connected dominating and absorbent sets in wireless Ad-Hoc networks. (c2011)
by: Markarian, Christine Hovsep
Published: (2016)