The maximum degree & diameter-bounded subgraph and its applications

Title: The maximum degree & diameter-bounded subgraph and its applications
Creator: Dekker, Anthony; Perez-Roses, Hebert; Pineda-Villavicencio, Guillermo; Watters, Paul
Relation: Journal of Mathematical Modelling and Algorithms Vol. 11, Issue 3, p. 1-20
Publisher Link: http://dx.doi.org/10.1007/s10852-012-9182-8
Publisher: Springer Netherlands
Resource Type: journal article
Date: 2012
Description: We introduce the problem of finding the largest subgraph of a given weighted undirected graph (host graph), subject to constraints on the maximum degree and the diameter. We discuss some applications in security, network design and parallel processing, and in connection with the latter we derive some bounds for the order of the largest subgraph in host graphs of practical interest: the mesh and the hypercube. We also present a heuristic strategy to solve the problem, and we prove an approximation ratio for the algorithm. Finally, we provide some experimental results with a variety of host networks, which show that the algorithm performs better in practice than the prediction provided by our theoretical approximation ratio.
Subject: network design; degree; botnets; mesh
Identifier: http://hdl.handle.net/1959.13/1317814
Identifier: uon:23514
Identifier: ISSN:1570-1166
Language: eng
Reviewed

		Thumbnail	File	Description	Size	Format