The Maximum Degree-and-Diameter-Bounded Subgraph problem (MaxDDBS) is a problem in graph theory. == Definition == Given a connected host graph G {\displaystyle G} , an upper bound for the degree Δ {\displaystyle \Delta } , and an upper bound for the diameter D {\displaystyle D} , we look for the largest subgraph S {\displaystyle S} of G {\displaystyle G} with maximum degree at most Δ {\displaystyle \Delta } and diameter at most D {\displaystyle D} .
The Maximum Degree-and-Diameter-Bounded Subgraph problem (MaxDDBS) is a problem in graph theory. == Definition == Given a connected host graph G {\displaystyle G} , an upper bound for the degree Δ {\displaystyle \Delta } , and an upper bound for the diameter D {\displaystyle D} , we look for the largest subgraph S {\displaystyle S} of G {\displaystyle G} with maximum degree at most Δ {\displaystyle \Delta } and diameter at most D {\displaystyle D} .
Source: Wikipedia "MaxDDBS" · CC BY-SA 4.0
Share this article: X · Bluesky