-
document
-
Devriendt, K.L.T. (author), Van Mieghem, P.F.A. (author)
The cut-set ∂V in a graph is defined as the set of all links between a set of nodes V and all other nodes in that graph. Finding bounds for the size of a cut-set |∂V| is an important problem, and is related to mixing times, connectedness and spreading processes on networks. A standard way to bound the number of links in a cut-set |∂V| relies...
journal article 2019
Source URL (retrieved on 2024-05-26 01:56): https://repository.tudelft.nl/islandora/search/%20?amp%3Bamp%3Bf%5B0%5D=mods_name_personal_author_namePart_family_ss%3A%22Wolters%22&%3Bamp%3Bf%5B1%5D=mods_name_personal_author_namePart_family_ss%3A%22Wahl%22&%3Bf%5B0%5D=RELS_EXT_isMemberOfCollection_uri_s%3A%22info%5C%3Afedora%5C/collection%5C%3Air%22&collection=research&f%5B0%5D=mods_name_personal_author_namePart_family_ss%3A%22Van%5C%20Mieghem%22&f%5B1%5D=mods_subject_topic_ss%3A%22Graph%5C%20cut%22