Sharper Lower Bounds in the Maximum Degree and Diameter Bounded Subgraph Problem in the Mesh
Abstract
The Maximum Degree and Diameter Bounded Subgraph Problem (MaxDDBS) asks: given a host graph G, a bound on maximum degree , and a diameter D, what is the largest subgraph of the host graph with degree bounded by and diameter bounded by D? In this paper, we investigate this problem when the host graph is the k-dimensional mesh. We provide lower bounds for the size of the largest subgraph of the mesh satisfying MaxDDBS for all k and > 3 that agree with the known upper bounds up to the first two terms, and show that for = 3, the lower bounds are at least the same order of growth as the upper bounds.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.